./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6325d9fccdba44ffb7ef0e133bfabfb6d285a7f8e20c4133b9b681e02437a24c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:34:05,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:34:05,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:34:05,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:34:05,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:34:05,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:34:05,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:34:05,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:34:05,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:34:05,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:34:05,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:34:05,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:34:05,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:34:05,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:34:05,180 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:34:05,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:34:05,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:34:05,181 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:34:05,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:34:05,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:34:05,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:34:05,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:34:05,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:34:05,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:34:05,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:34:05,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:34:05,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:34:05,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:34:05,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:34:05,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:34:05,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:34:05,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:34:05,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:34:05,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:34:05,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:34:05,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:34:05,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:34:05,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:34:05,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:34:05,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:34:05,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:34:05,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:34:05,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6325d9fccdba44ffb7ef0e133bfabfb6d285a7f8e20c4133b9b681e02437a24c [2024-11-11 22:34:05,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:34:05,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:34:05,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:34:05,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:34:05,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:34:05,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-11 22:34:06,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:34:07,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:34:07,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-11 22:34:07,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52f9738f/b29ad53fa4a34655a443359c60435f2b/FLAG6ef0db6ed [2024-11-11 22:34:07,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e52f9738f/b29ad53fa4a34655a443359c60435f2b [2024-11-11 22:34:07,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:34:07,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:34:07,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:34:07,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:34:07,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:34:07,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:34:07" (1/1) ... [2024-11-11 22:34:07,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f18dd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:07, skipping insertion in model container [2024-11-11 22:34:07,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:34:07" (1/1) ... [2024-11-11 22:34:07,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:34:07,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2024-11-11 22:34:08,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2024-11-11 22:34:08,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:34:08,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:34:08,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2024-11-11 22:34:08,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2024-11-11 22:34:09,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:34:09,234 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:34:09,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09 WrapperNode [2024-11-11 22:34:09,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:34:09,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:34:09,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:34:09,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:34:09,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:09,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:09,576 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4984 [2024-11-11 22:34:09,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:34:09,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:34:09,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:34:09,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:34:09,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:09,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:09,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:09,891 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:34:09,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:09,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:10,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:10,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:10,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:10,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:10,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:34:10,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:34:10,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:34:10,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:34:10,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (1/1) ... [2024-11-11 22:34:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:34:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:10,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:34:10,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:34:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:34:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:34:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:34:10,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:34:10,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:34:10,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:34:14,640 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-11-11 22:34:14,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:34:14,669 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:34:14,670 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:34:14,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:34:14 BoogieIcfgContainer [2024-11-11 22:34:14,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:34:14,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:34:14,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:34:14,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:34:14,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:34:07" (1/3) ... [2024-11-11 22:34:14,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e36bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:34:14, skipping insertion in model container [2024-11-11 22:34:14,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:09" (2/3) ... [2024-11-11 22:34:14,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e36bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:34:14, skipping insertion in model container [2024-11-11 22:34:14,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:34:14" (3/3) ... [2024-11-11 22:34:14,683 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-11 22:34:14,699 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:34:14,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:34:14,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:34:14,798 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;@2bff1a67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:34:14,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:34:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 22:34:14,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:14,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:14,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:14,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash -934405548, now seen corresponding path program 1 times [2024-11-11 22:34:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:14,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439255575] [2024-11-11 22:34:14,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:15,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439255575] [2024-11-11 22:34:15,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439255575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:34:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890604969] [2024-11-11 22:34:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:15,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 22:34:15,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 22:34:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:34:15,072 INFO L87 Difference]: Start difference. First operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:15,156 INFO L93 Difference]: Finished difference Result 1724 states and 3278 transitions. [2024-11-11 22:34:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 22:34:15,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-11 22:34:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:15,178 INFO L225 Difference]: With dead ends: 1724 [2024-11-11 22:34:15,178 INFO L226 Difference]: Without dead ends: 808 [2024-11-11 22:34:15,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:34:15,186 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:15,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-11 22:34:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-11-11 22:34:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2024-11-11 22:34:15,271 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2024-11-11 22:34:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:15,272 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2024-11-11 22:34:15,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2024-11-11 22:34:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 22:34:15,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:15,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:15,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:34:15,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:15,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1945522798, now seen corresponding path program 1 times [2024-11-11 22:34:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:15,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731650327] [2024-11-11 22:34:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:15,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731650327] [2024-11-11 22:34:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731650327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:15,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:15,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182610856] [2024-11-11 22:34:15,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:15,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:15,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:15,488 INFO L87 Difference]: Start difference. First operand 808 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:15,581 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2024-11-11 22:34:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-11 22:34:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:15,586 INFO L225 Difference]: With dead ends: 844 [2024-11-11 22:34:15,586 INFO L226 Difference]: Without dead ends: 808 [2024-11-11 22:34:15,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:15,588 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:15,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-11 22:34:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-11-11 22:34:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2024-11-11 22:34:15,615 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2024-11-11 22:34:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:15,615 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2024-11-11 22:34:15,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2024-11-11 22:34:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 22:34:15,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:15,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:15,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:34:15,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:15,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1226597962, now seen corresponding path program 1 times [2024-11-11 22:34:15,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:15,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117883983] [2024-11-11 22:34:15,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117883983] [2024-11-11 22:34:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117883983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:15,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:15,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014517776] [2024-11-11 22:34:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:15,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:15,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:15,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:15,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:15,770 INFO L87 Difference]: Start difference. First operand 808 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:15,894 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2024-11-11 22:34:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:34:15,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-11 22:34:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:15,899 INFO L225 Difference]: With dead ends: 1000 [2024-11-11 22:34:15,900 INFO L226 Difference]: Without dead ends: 968 [2024-11-11 22:34:15,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:34:15,902 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4682 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:15,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 1758 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:34:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-11-11 22:34:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2024-11-11 22:34:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.8636363636363635) internal successors, (1558), 837 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2024-11-11 22:34:15,922 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2024-11-11 22:34:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:15,925 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2024-11-11 22:34:15,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2024-11-11 22:34:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 22:34:15,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:15,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:15,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:34:15,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 523901274, now seen corresponding path program 1 times [2024-11-11 22:34:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:15,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502454731] [2024-11-11 22:34:15,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:16,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:16,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502454731] [2024-11-11 22:34:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502454731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415709775] [2024-11-11 22:34:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:16,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:16,040 INFO L87 Difference]: Start difference. First operand 838 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:16,078 INFO L93 Difference]: Finished difference Result 951 states and 1733 transitions. [2024-11-11 22:34:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 22:34:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:16,082 INFO L225 Difference]: With dead ends: 951 [2024-11-11 22:34:16,082 INFO L226 Difference]: Without dead ends: 889 [2024-11-11 22:34:16,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:16,087 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:16,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-11 22:34:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2024-11-11 22:34:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8437146092865233) internal successors, (1628), 884 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1628 transitions. [2024-11-11 22:34:16,109 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1628 transitions. Word has length 37 [2024-11-11 22:34:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:16,110 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1628 transitions. [2024-11-11 22:34:16,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1628 transitions. [2024-11-11 22:34:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 22:34:16,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:16,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:16,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:34:16,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:16,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 590394786, now seen corresponding path program 1 times [2024-11-11 22:34:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:16,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461828326] [2024-11-11 22:34:16,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461828326] [2024-11-11 22:34:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461828326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:16,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:16,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206194181] [2024-11-11 22:34:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:16,329 INFO L87 Difference]: Start difference. First operand 885 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:16,412 INFO L93 Difference]: Finished difference Result 996 states and 1796 transitions. [2024-11-11 22:34:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:16,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 22:34:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:16,417 INFO L225 Difference]: With dead ends: 996 [2024-11-11 22:34:16,417 INFO L226 Difference]: Without dead ends: 887 [2024-11-11 22:34:16,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:34:16,419 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 2952 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:16,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 1598 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-11 22:34:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2024-11-11 22:34:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8414496036240091) internal successors, (1626), 884 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2024-11-11 22:34:16,444 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2024-11-11 22:34:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:16,445 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2024-11-11 22:34:16,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2024-11-11 22:34:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 22:34:16,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:16,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:16,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:34:16,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:16,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash 707645968, now seen corresponding path program 1 times [2024-11-11 22:34:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:16,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560442775] [2024-11-11 22:34:16,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560442775] [2024-11-11 22:34:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560442775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:16,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:34:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909058020] [2024-11-11 22:34:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:16,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:34:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:34:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:34:16,683 INFO L87 Difference]: Start difference. First operand 885 states and 1626 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:16,789 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2024-11-11 22:34:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:34:16,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-11 22:34:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:16,796 INFO L225 Difference]: With dead ends: 893 [2024-11-11 22:34:16,796 INFO L226 Difference]: Without dead ends: 891 [2024-11-11 22:34:16,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:34:16,800 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:16,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-11 22:34:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2024-11-11 22:34:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8346456692913387) internal successors, (1631), 890 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2024-11-11 22:34:16,828 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2024-11-11 22:34:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:16,829 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2024-11-11 22:34:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2024-11-11 22:34:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:16,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:16,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:16,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:34:16,831 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1903217474, now seen corresponding path program 1 times [2024-11-11 22:34:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078155539] [2024-11-11 22:34:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:16,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:16,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078155539] [2024-11-11 22:34:16,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078155539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:16,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331236434] [2024-11-11 22:34:16,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:16,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:16,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:16,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:16,877 INFO L87 Difference]: Start difference. First operand 891 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:16,916 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2024-11-11 22:34:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:16,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-11 22:34:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:16,921 INFO L225 Difference]: With dead ends: 1105 [2024-11-11 22:34:16,921 INFO L226 Difference]: Without dead ends: 990 [2024-11-11 22:34:16,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:16,922 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:16,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1587 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-11 22:34:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2024-11-11 22:34:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 986 states have (on average 1.793103448275862) internal successors, (1768), 987 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2024-11-11 22:34:16,946 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2024-11-11 22:34:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:16,948 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2024-11-11 22:34:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2024-11-11 22:34:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:16,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:16,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:16,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:34:16,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 122284610, now seen corresponding path program 1 times [2024-11-11 22:34:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971953391] [2024-11-11 22:34:16,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971953391] [2024-11-11 22:34:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971953391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239717525] [2024-11-11 22:34:17,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:17,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:17,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:17,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:17,008 INFO L87 Difference]: Start difference. First operand 988 states and 1768 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:17,040 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2024-11-11 22:34:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:17,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-11 22:34:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:17,045 INFO L225 Difference]: With dead ends: 1380 [2024-11-11 22:34:17,045 INFO L226 Difference]: Without dead ends: 1168 [2024-11-11 22:34:17,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:17,047 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:17,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-11 22:34:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2024-11-11 22:34:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1164 states have (on average 1.7268041237113403) internal successors, (2010), 1165 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2024-11-11 22:34:17,075 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2024-11-11 22:34:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:17,075 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2024-11-11 22:34:17,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2024-11-11 22:34:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 22:34:17,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:17,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:17,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:34:17,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:17,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1688735299, now seen corresponding path program 1 times [2024-11-11 22:34:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334709105] [2024-11-11 22:34:17,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334709105] [2024-11-11 22:34:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334709105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:17,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:17,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:17,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929163856] [2024-11-11 22:34:17,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:17,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:17,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:17,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:17,131 INFO L87 Difference]: Start difference. First operand 1166 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:17,168 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2024-11-11 22:34:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-11 22:34:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:17,175 INFO L225 Difference]: With dead ends: 1589 [2024-11-11 22:34:17,175 INFO L226 Difference]: Without dead ends: 1354 [2024-11-11 22:34:17,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:17,177 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:17,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-11-11 22:34:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2024-11-11 22:34:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1350 states have (on average 1.677037037037037) internal successors, (2264), 1351 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2024-11-11 22:34:17,209 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2024-11-11 22:34:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2024-11-11 22:34:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2024-11-11 22:34:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:17,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:17,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:17,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:34:17,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:17,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 923003988, now seen corresponding path program 1 times [2024-11-11 22:34:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91263153] [2024-11-11 22:34:17,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 22:34:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:17,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91263153] [2024-11-11 22:34:17,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91263153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:17,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:17,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125790328] [2024-11-11 22:34:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:17,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:17,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:17,363 INFO L87 Difference]: Start difference. First operand 1352 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:17,481 INFO L93 Difference]: Finished difference Result 3208 states and 4844 transitions. [2024-11-11 22:34:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:17,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 22:34:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:17,491 INFO L225 Difference]: With dead ends: 3208 [2024-11-11 22:34:17,491 INFO L226 Difference]: Without dead ends: 2634 [2024-11-11 22:34:17,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:34:17,493 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 3057 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3057 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:17,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3057 Valid, 3155 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:34:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-11-11 22:34:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1924. [2024-11-11 22:34:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1922 states have (on average 1.5879292403746097) internal successors, (3052), 1923 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3052 transitions. [2024-11-11 22:34:17,544 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3052 transitions. Word has length 54 [2024-11-11 22:34:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:17,545 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3052 transitions. [2024-11-11 22:34:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3052 transitions. [2024-11-11 22:34:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:17,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:17,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:17,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:34:17,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:17,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:17,547 INFO L85 PathProgramCache]: Analyzing trace with hash -857928876, now seen corresponding path program 1 times [2024-11-11 22:34:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:17,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695259048] [2024-11-11 22:34:17,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:34:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:17,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695259048] [2024-11-11 22:34:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695259048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:17,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:17,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:17,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440312325] [2024-11-11 22:34:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:17,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:17,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:17,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:17,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:17,683 INFO L87 Difference]: Start difference. First operand 1924 states and 3052 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:17,808 INFO L93 Difference]: Finished difference Result 3780 states and 5632 transitions. [2024-11-11 22:34:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 22:34:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:17,821 INFO L225 Difference]: With dead ends: 3780 [2024-11-11 22:34:17,822 INFO L226 Difference]: Without dead ends: 3206 [2024-11-11 22:34:17,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:34:17,825 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3049 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:17,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 3170 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:34:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-11-11 22:34:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2784. [2024-11-11 22:34:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.518332135154565) internal successors, (4224), 2783 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4224 transitions. [2024-11-11 22:34:17,955 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4224 transitions. Word has length 54 [2024-11-11 22:34:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:17,956 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4224 transitions. [2024-11-11 22:34:17,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4224 transitions. [2024-11-11 22:34:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 22:34:17,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:17,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:17,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:34:17,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:17,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash 894361900, now seen corresponding path program 1 times [2024-11-11 22:34:17,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:17,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949772225] [2024-11-11 22:34:17,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949772225] [2024-11-11 22:34:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949772225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:18,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:18,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467239552] [2024-11-11 22:34:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:18,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:18,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:18,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:18,093 INFO L87 Difference]: Start difference. First operand 2784 states and 4224 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:18,147 INFO L93 Difference]: Finished difference Result 4260 states and 6287 transitions. [2024-11-11 22:34:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:18,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-11 22:34:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:18,155 INFO L225 Difference]: With dead ends: 4260 [2024-11-11 22:34:18,156 INFO L226 Difference]: Without dead ends: 2254 [2024-11-11 22:34:18,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:18,159 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:18,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2024-11-11 22:34:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2024-11-11 22:34:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.5537777777777777) internal successors, (3496), 2251 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3496 transitions. [2024-11-11 22:34:18,224 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3496 transitions. Word has length 56 [2024-11-11 22:34:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:18,224 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3496 transitions. [2024-11-11 22:34:18,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3496 transitions. [2024-11-11 22:34:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 22:34:18,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:18,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:34:18,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1218909775, now seen corresponding path program 1 times [2024-11-11 22:34:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379655741] [2024-11-11 22:34:18,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:18,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379655741] [2024-11-11 22:34:18,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379655741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:18,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483726018] [2024-11-11 22:34:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:18,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:18,342 INFO L87 Difference]: Start difference. First operand 2252 states and 3496 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:18,462 INFO L93 Difference]: Finished difference Result 3508 states and 5252 transitions. [2024-11-11 22:34:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:18,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-11 22:34:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:18,474 INFO L225 Difference]: With dead ends: 3508 [2024-11-11 22:34:18,474 INFO L226 Difference]: Without dead ends: 3090 [2024-11-11 22:34:18,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:34:18,477 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 3051 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:18,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3147 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-11-11 22:34:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2668. [2024-11-11 22:34:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5273818454613652) internal successors, (4072), 2667 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4072 transitions. [2024-11-11 22:34:18,563 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4072 transitions. Word has length 56 [2024-11-11 22:34:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:18,564 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4072 transitions. [2024-11-11 22:34:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4072 transitions. [2024-11-11 22:34:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 22:34:18,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:18,565 INFO L218 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] [2024-11-11 22:34:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:34:18,566 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:18,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -877348108, now seen corresponding path program 1 times [2024-11-11 22:34:18,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859321491] [2024-11-11 22:34:18,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:18,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859321491] [2024-11-11 22:34:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859321491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:18,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922611490] [2024-11-11 22:34:18,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:18,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:18,664 INFO L87 Difference]: Start difference. First operand 2668 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:18,711 INFO L93 Difference]: Finished difference Result 3608 states and 5370 transitions. [2024-11-11 22:34:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-11 22:34:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:18,718 INFO L225 Difference]: With dead ends: 3608 [2024-11-11 22:34:18,718 INFO L226 Difference]: Without dead ends: 1734 [2024-11-11 22:34:18,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:18,722 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:18,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-11-11 22:34:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2024-11-11 22:34:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.5942196531791908) internal successors, (2758), 1731 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2758 transitions. [2024-11-11 22:34:18,774 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2758 transitions. Word has length 57 [2024-11-11 22:34:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:18,774 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2758 transitions. [2024-11-11 22:34:18,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2758 transitions. [2024-11-11 22:34:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 22:34:18,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:18,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:18,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:34:18,776 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:18,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1226511174, now seen corresponding path program 1 times [2024-11-11 22:34:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:18,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78426004] [2024-11-11 22:34:18,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78426004] [2024-11-11 22:34:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78426004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:18,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487983375] [2024-11-11 22:34:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:18,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:18,884 INFO L87 Difference]: Start difference. First operand 1732 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:18,922 INFO L93 Difference]: Finished difference Result 2204 states and 3399 transitions. [2024-11-11 22:34:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:18,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-11 22:34:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:18,928 INFO L225 Difference]: With dead ends: 2204 [2024-11-11 22:34:18,928 INFO L226 Difference]: Without dead ends: 1266 [2024-11-11 22:34:18,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:18,931 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:18,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-11 22:34:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2024-11-11 22:34:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1262 states have (on average 1.6719492868462758) internal successors, (2110), 1263 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2110 transitions. [2024-11-11 22:34:18,972 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2110 transitions. Word has length 59 [2024-11-11 22:34:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:18,973 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2110 transitions. [2024-11-11 22:34:18,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2110 transitions. [2024-11-11 22:34:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 22:34:18,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:18,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:34:18,975 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1826022888, now seen corresponding path program 1 times [2024-11-11 22:34:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014578266] [2024-11-11 22:34:18,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014578266] [2024-11-11 22:34:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014578266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:20,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014332260] [2024-11-11 22:34:20,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:20,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:20,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:20,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:34:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:20,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 22:34:20,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:20,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014332260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:20,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:20,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2024-11-11 22:34:20,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782842948] [2024-11-11 22:34:20,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:20,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 22:34:20,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:20,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 22:34:20,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:34:20,940 INFO L87 Difference]: Start difference. First operand 1264 states and 2110 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:22,982 INFO L93 Difference]: Finished difference Result 3665 states and 5284 transitions. [2024-11-11 22:34:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-11 22:34:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-11 22:34:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:22,994 INFO L225 Difference]: With dead ends: 3665 [2024-11-11 22:34:22,994 INFO L226 Difference]: Without dead ends: 3195 [2024-11-11 22:34:22,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2024-11-11 22:34:22,997 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 14347 mSDsluCounter, 7682 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14347 SdHoareTripleChecker+Valid, 9181 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:22,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14347 Valid, 9181 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:34:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2024-11-11 22:34:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3161. [2024-11-11 22:34:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 3159 states have (on average 1.4102564102564104) internal successors, (4455), 3160 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4455 transitions. [2024-11-11 22:34:23,076 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4455 transitions. Word has length 61 [2024-11-11 22:34:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:23,076 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 4455 transitions. [2024-11-11 22:34:23,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4455 transitions. [2024-11-11 22:34:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:34:23,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:23,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:23,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:34:23,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 22:34:23,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:23,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 459765187, now seen corresponding path program 1 times [2024-11-11 22:34:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511787199] [2024-11-11 22:34:23,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:24,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:24,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511787199] [2024-11-11 22:34:24,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511787199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:24,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773259269] [2024-11-11 22:34:24,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:24,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:24,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:24,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:24,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:34:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:25,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 22:34:25,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:25,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:26,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773259269] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:26,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:26,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-11-11 22:34:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751545544] [2024-11-11 22:34:26,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:26,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 22:34:26,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 22:34:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-11-11 22:34:26,233 INFO L87 Difference]: Start difference. First operand 3161 states and 4455 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:26,895 INFO L93 Difference]: Finished difference Result 7268 states and 9645 transitions. [2024-11-11 22:34:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:34:26,896 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 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-11-11 22:34:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:26,911 INFO L225 Difference]: With dead ends: 7268 [2024-11-11 22:34:26,913 INFO L226 Difference]: Without dead ends: 5309 [2024-11-11 22:34:26,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 22:34:26,918 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 15169 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15169 SdHoareTripleChecker+Valid, 4758 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:26,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15169 Valid, 4758 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:34:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2024-11-11 22:34:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5243. [2024-11-11 22:34:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5241 states have (on average 1.3325701202060676) internal successors, (6984), 5242 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6984 transitions. [2024-11-11 22:34:27,105 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6984 transitions. Word has length 62 [2024-11-11 22:34:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:27,105 INFO L471 AbstractCegarLoop]: Abstraction has 5243 states and 6984 transitions. [2024-11-11 22:34:27,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6984 transitions. [2024-11-11 22:34:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:34:27,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:27,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:27,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 22:34:27,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 22:34:27,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:27,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1147902773, now seen corresponding path program 1 times [2024-11-11 22:34:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:27,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172321601] [2024-11-11 22:34:27,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:27,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172321601] [2024-11-11 22:34:27,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172321601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392199560] [2024-11-11 22:34:27,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:27,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:27,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:27,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:27,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:34:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:27,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 22:34:27,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:28,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392199560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:29,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-11 22:34:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685358693] [2024-11-11 22:34:29,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-11 22:34:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-11 22:34:29,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-11-11 22:34:29,164 INFO L87 Difference]: Start difference. First operand 5243 states and 6984 transitions. Second operand has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:31,732 INFO L93 Difference]: Finished difference Result 13264 states and 17044 transitions. [2024-11-11 22:34:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-11 22:34:31,733 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 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-11-11 22:34:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:31,748 INFO L225 Difference]: With dead ends: 13264 [2024-11-11 22:34:31,748 INFO L226 Difference]: Without dead ends: 9304 [2024-11-11 22:34:31,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-11-11 22:34:31,757 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 13920 mSDsluCounter, 14047 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13920 SdHoareTripleChecker+Valid, 15555 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:31,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13920 Valid, 15555 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:34:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2024-11-11 22:34:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 5902. [2024-11-11 22:34:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5902 states, 5900 states have (on average 1.3220338983050848) internal successors, (7800), 5901 states have internal predecessors, (7800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 7800 transitions. [2024-11-11 22:34:31,983 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 7800 transitions. Word has length 62 [2024-11-11 22:34:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:31,984 INFO L471 AbstractCegarLoop]: Abstraction has 5902 states and 7800 transitions. [2024-11-11 22:34:31,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 7800 transitions. [2024-11-11 22:34:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 22:34:31,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:31,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:32,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:34:32,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 22:34:32,190 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:32,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash 807603108, now seen corresponding path program 1 times [2024-11-11 22:34:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:32,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462034690] [2024-11-11 22:34:32,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462034690] [2024-11-11 22:34:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462034690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235607402] [2024-11-11 22:34:32,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:32,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:32,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:32,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:32,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:34:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:32,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 22:34:32,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:33,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235607402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:34,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-11-11 22:34:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644099742] [2024-11-11 22:34:34,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:34,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 22:34:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:34,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 22:34:34,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-11-11 22:34:34,665 INFO L87 Difference]: Start difference. First operand 5902 states and 7800 transitions. Second operand has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:35,937 INFO L93 Difference]: Finished difference Result 12552 states and 16103 transitions. [2024-11-11 22:34:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 22:34:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 22:34:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:35,955 INFO L225 Difference]: With dead ends: 12552 [2024-11-11 22:34:35,955 INFO L226 Difference]: Without dead ends: 8238 [2024-11-11 22:34:35,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=637, Invalid=2015, Unknown=0, NotChecked=0, Total=2652 [2024-11-11 22:34:35,965 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 21567 mSDsluCounter, 7866 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21567 SdHoareTripleChecker+Valid, 9380 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:35,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21567 Valid, 9380 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:34:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2024-11-11 22:34:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 7814. [2024-11-11 22:34:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7814 states, 7812 states have (on average 1.290962621607783) internal successors, (10085), 7813 states have internal predecessors, (10085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 10085 transitions. [2024-11-11 22:34:36,356 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 10085 transitions. Word has length 63 [2024-11-11 22:34:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:36,356 INFO L471 AbstractCegarLoop]: Abstraction has 7814 states and 10085 transitions. [2024-11-11 22:34:36,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 10085 transitions. [2024-11-11 22:34:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 22:34:36,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:36,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:36,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 22:34:36,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:36,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:36,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1786741782, now seen corresponding path program 1 times [2024-11-11 22:34:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:36,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880375854] [2024-11-11 22:34:36,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880375854] [2024-11-11 22:34:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880375854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875604683] [2024-11-11 22:34:38,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:38,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:38,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:38,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:38,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 22:34:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:38,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 22:34:38,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:40,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875604683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:41,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:41,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 15] total 51 [2024-11-11 22:34:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364806412] [2024-11-11 22:34:41,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:41,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-11 22:34:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-11 22:34:41,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2024-11-11 22:34:41,951 INFO L87 Difference]: Start difference. First operand 7814 states and 10085 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:00,119 INFO L93 Difference]: Finished difference Result 14540 states and 18342 transitions. [2024-11-11 22:35:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-11 22:35:00,120 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 22:35:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:00,138 INFO L225 Difference]: With dead ends: 14540 [2024-11-11 22:35:00,139 INFO L226 Difference]: Without dead ends: 11701 [2024-11-11 22:35:00,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=4031, Invalid=15991, Unknown=0, NotChecked=0, Total=20022 [2024-11-11 22:35:00,149 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 31060 mSDsluCounter, 23922 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31060 SdHoareTripleChecker+Valid, 25458 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:00,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31060 Valid, 25458 Invalid, 2601 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [121 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:35:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11701 states. [2024-11-11 22:35:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11701 to 9885. [2024-11-11 22:35:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9885 states, 9883 states have (on average 1.2800768997268035) internal successors, (12651), 9884 states have internal predecessors, (12651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9885 states to 9885 states and 12651 transitions. [2024-11-11 22:35:00,670 INFO L78 Accepts]: Start accepts. Automaton has 9885 states and 12651 transitions. Word has length 63 [2024-11-11 22:35:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:00,670 INFO L471 AbstractCegarLoop]: Abstraction has 9885 states and 12651 transitions. [2024-11-11 22:35:00,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9885 states and 12651 transitions. [2024-11-11 22:35:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 22:35:00,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:00,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:00,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 22:35:00,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:00,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:00,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 606047555, now seen corresponding path program 1 times [2024-11-11 22:35:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:00,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942238400] [2024-11-11 22:35:00,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942238400] [2024-11-11 22:35:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942238400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:35:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:35:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:35:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797676899] [2024-11-11 22:35:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:35:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:35:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:35:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:35:00,928 INFO L87 Difference]: Start difference. First operand 9885 states and 12651 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:04,322 INFO L93 Difference]: Finished difference Result 11389 states and 15524 transitions. [2024-11-11 22:35:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:35:04,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 22:35:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:04,338 INFO L225 Difference]: With dead ends: 11389 [2024-11-11 22:35:04,339 INFO L226 Difference]: Without dead ends: 10636 [2024-11-11 22:35:04,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:35:04,344 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 810 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:04,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 547 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 22:35:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10636 states. [2024-11-11 22:35:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10636 to 10636. [2024-11-11 22:35:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10636 states, 10634 states have (on average 1.2817378220801203) internal successors, (13630), 10635 states have internal predecessors, (13630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 13630 transitions. [2024-11-11 22:35:04,733 INFO L78 Accepts]: Start accepts. Automaton has 10636 states and 13630 transitions. Word has length 63 [2024-11-11 22:35:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:04,734 INFO L471 AbstractCegarLoop]: Abstraction has 10636 states and 13630 transitions. [2024-11-11 22:35:04,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 10636 states and 13630 transitions. [2024-11-11 22:35:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 22:35:04,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:04,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:04,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:35:04,736 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:04,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 532152701, now seen corresponding path program 1 times [2024-11-11 22:35:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322801350] [2024-11-11 22:35:04,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:05,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322801350] [2024-11-11 22:35:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322801350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710942660] [2024-11-11 22:35:05,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:05,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:05,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:05,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:05,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 22:35:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:05,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 22:35:05,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:06,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:07,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710942660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:07,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:07,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2024-11-11 22:35:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55450870] [2024-11-11 22:35:07,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:07,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-11 22:35:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-11 22:35:07,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 22:35:07,524 INFO L87 Difference]: Start difference. First operand 10636 states and 13630 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:09,968 INFO L93 Difference]: Finished difference Result 14134 states and 17907 transitions. [2024-11-11 22:35:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 22:35:09,968 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-11 22:35:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:09,982 INFO L225 Difference]: With dead ends: 14134 [2024-11-11 22:35:09,982 INFO L226 Difference]: Without dead ends: 10323 [2024-11-11 22:35:09,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=822, Invalid=2960, Unknown=0, NotChecked=0, Total=3782 [2024-11-11 22:35:09,990 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 18874 mSDsluCounter, 15365 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18874 SdHoareTripleChecker+Valid, 16882 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:09,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18874 Valid, 16882 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:35:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10323 states. [2024-11-11 22:35:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10323 to 8705. [2024-11-11 22:35:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8705 states, 8703 states have (on average 1.2885211995863495) internal successors, (11214), 8704 states have internal predecessors, (11214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8705 states to 8705 states and 11214 transitions. [2024-11-11 22:35:10,321 INFO L78 Accepts]: Start accepts. Automaton has 8705 states and 11214 transitions. Word has length 64 [2024-11-11 22:35:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:10,321 INFO L471 AbstractCegarLoop]: Abstraction has 8705 states and 11214 transitions. [2024-11-11 22:35:10,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 8705 states and 11214 transitions. [2024-11-11 22:35:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:35:10,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:10,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:10,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 22:35:10,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:10,527 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:10,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1624666796, now seen corresponding path program 1 times [2024-11-11 22:35:10,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336623441] [2024-11-11 22:35:10,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:10,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336623441] [2024-11-11 22:35:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336623441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623401147] [2024-11-11 22:35:12,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:12,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:12,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:12,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:12,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 22:35:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:12,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 22:35:12,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:12,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623401147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:13,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 42 [2024-11-11 22:35:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688321405] [2024-11-11 22:35:13,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:13,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-11 22:35:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-11 22:35:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 22:35:13,756 INFO L87 Difference]: Start difference. First operand 8705 states and 11214 transitions. Second operand has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)