./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/eca-rers2012/Problem19_label01.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 f26c9b68539fd7e45903345f01b5b0bdfd3aa591442c893b5a75fc637a7ed516 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:01:53,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:01:53,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:01:53,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:01:53,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:01:53,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:01:53,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:01:53,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:01:53,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:01:53,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:01:53,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:01:53,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:01:53,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:01:53,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:01:53,619 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:01:53,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:01:53,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:01:53,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:01:53,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:01:53,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:01:53,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:01:53,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:01:53,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:01:53,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:01:53,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:01:53,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:01:53,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:01:53,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:01:53,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:01:53,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:01:53,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:01:53,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:01:53,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:01:53,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:01:53,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:01:53,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:01:53,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:01:53,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:01:53,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:01:53,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:01:53,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:01:53,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:01:53,626 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 -> f26c9b68539fd7e45903345f01b5b0bdfd3aa591442c893b5a75fc637a7ed516 [2024-11-09 20:01:53,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:01:53,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:01:53,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:01:53,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:01:53,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:01:53,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label01.c [2024-11-09 20:01:54,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:01:55,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:01:55,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label01.c [2024-11-09 20:01:55,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d0f04e3/721981581fe347259c31036a8d61c88e/FLAGf8716bf81 [2024-11-09 20:01:55,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d0f04e3/721981581fe347259c31036a8d61c88e [2024-11-09 20:01:55,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:01:55,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:01:55,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:01:55,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:01:55,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:01:55,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:55" (1/1) ... [2024-11-09 20:01:55,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5906d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:55, skipping insertion in model container [2024-11-09 20:01:55,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:55" (1/1) ... [2024-11-09 20:01:55,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:01:55,964 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/eca-rers2012/Problem19_label01.c[8162,8175] [2024-11-09 20:01:56,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:01:56,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:01:56,921 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/eca-rers2012/Problem19_label01.c[8162,8175] [2024-11-09 20:01:57,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:01:57,468 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:01:57,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57 WrapperNode [2024-11-09 20:01:57,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:01:57,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:01:57,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:01:57,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:01:57,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:57,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,250 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9430 [2024-11-09 20:01:58,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:01:58,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:01:58,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:01:58,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:01:58,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,660 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-09 20:01:58,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:58,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:59,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:01:59,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:01:59,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:01:59,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:01:59,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (1/1) ... [2024-11-09 20:01:59,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:01:59,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:01:59,105 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-09 20:01:59,107 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-09 20:01:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:01:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:01:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:01:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:01:59,208 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:01:59,210 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:02:06,208 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2024-11-09 20:02:06,208 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2024-11-09 20:02:06,208 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2024-11-09 20:02:06,208 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2024-11-09 20:02:06,209 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2024-11-09 20:02:06,646 INFO L? ?]: Removed 3705 outVars from TransFormulas that were not future-live. [2024-11-09 20:02:06,646 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:02:06,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:02:06,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:02:06,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:02:06 BoogieIcfgContainer [2024-11-09 20:02:06,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:02:06,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:02:06,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:02:06,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:02:06,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:01:55" (1/3) ... [2024-11-09 20:02:06,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e287300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:02:06, skipping insertion in model container [2024-11-09 20:02:06,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:57" (2/3) ... [2024-11-09 20:02:06,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e287300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:02:06, skipping insertion in model container [2024-11-09 20:02:06,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:02:06" (3/3) ... [2024-11-09 20:02:06,703 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label01.c [2024-11-09 20:02:06,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:02:06,716 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:02:06,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:02:06,807 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;@3db61d8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:02:06,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:02:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 1751 states, 1749 states have (on average 2.606060606060606) internal successors, (4558), 1750 states have internal predecessors, (4558), 0 states have call successors, (0), 0 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-09 20:02:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 20:02:06,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:02:06,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:02:06,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:02:06,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:02:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1177160504, now seen corresponding path program 1 times [2024-11-09 20:02:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:02:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91951923] [2024-11-09 20:02:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:02:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:07,179 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-09 20:02:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:02:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91951923] [2024-11-09 20:02:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91951923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:02:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:02:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:02:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496240307] [2024-11-09 20:02:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:02:07,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:02:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:02:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:02:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:02:07,209 INFO L87 Difference]: Start difference. First operand has 1751 states, 1749 states have (on average 2.606060606060606) internal successors, (4558), 1750 states have internal predecessors, (4558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:02:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:02:14,046 INFO L93 Difference]: Finished difference Result 4981 states and 13292 transitions. [2024-11-09 20:02:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:02:14,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 20:02:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:02:14,074 INFO L225 Difference]: With dead ends: 4981 [2024-11-09 20:02:14,075 INFO L226 Difference]: Without dead ends: 3166 [2024-11-09 20:02:14,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:02:14,082 INFO L432 NwaCegarLoop]: 1355 mSDtfsCounter, 2773 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7250 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2773 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 8373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 7250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-09 20:02:14,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2773 Valid, 1528 Invalid, 8373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 7250 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-09 20:02:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2024-11-09 20:02:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3126. [2024-11-09 20:02:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 3125 states have (on average 2.45184) internal successors, (7662), 3125 states have internal predecessors, (7662), 0 states have call successors, (0), 0 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-09 20:02:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 7662 transitions. [2024-11-09 20:02:14,204 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 7662 transitions. Word has length 65 [2024-11-09 20:02:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:02:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 7662 transitions. [2024-11-09 20:02:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:02:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 7662 transitions. [2024-11-09 20:02:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 20:02:14,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:02:14,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:02:14,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:02:14,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:02:14,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:02:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash -19515458, now seen corresponding path program 1 times [2024-11-09 20:02:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:02:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130911498] [2024-11-09 20:02:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:14,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:02:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:02:14,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:02:14,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130911498] [2024-11-09 20:02:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130911498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:02:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:02:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:02:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767663422] [2024-11-09 20:02:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:02:14,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:02:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:02:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:02:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:02:14,542 INFO L87 Difference]: Start difference. First operand 3126 states and 7662 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-09 20:02:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:02:24,502 INFO L93 Difference]: Finished difference Result 10384 states and 25636 transitions. [2024-11-09 20:02:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:02:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-09 20:02:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:02:24,526 INFO L225 Difference]: With dead ends: 10384 [2024-11-09 20:02:24,527 INFO L226 Difference]: Without dead ends: 7260 [2024-11-09 20:02:24,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:02:24,532 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 8357 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 10872 mSolverCounterSat, 2736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8357 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 13608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2736 IncrementalHoareTripleChecker+Valid, 10872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-09 20:02:24,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8357 Valid, 968 Invalid, 13608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2736 Valid, 10872 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-09 20:02:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2024-11-09 20:02:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 7254. [2024-11-09 20:02:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7254 states, 7253 states have (on average 2.3637115676271887) internal successors, (17144), 7253 states have internal predecessors, (17144), 0 states have call successors, (0), 0 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-09 20:02:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 17144 transitions. [2024-11-09 20:02:24,645 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 17144 transitions. Word has length 137 [2024-11-09 20:02:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:02:24,646 INFO L471 AbstractCegarLoop]: Abstraction has 7254 states and 17144 transitions. [2024-11-09 20:02:24,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-09 20:02:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 17144 transitions. [2024-11-09 20:02:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-09 20:02:24,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:02:24,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:02:24,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:02:24,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:02:24,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:02:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1935407904, now seen corresponding path program 1 times [2024-11-09 20:02:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:02:24,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928313863] [2024-11-09 20:02:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:02:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:02:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:02:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928313863] [2024-11-09 20:02:25,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928313863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:02:25,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:02:25,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:02:25,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938408123] [2024-11-09 20:02:25,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:02:25,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:02:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:02:25,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:02:25,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:02:25,422 INFO L87 Difference]: Start difference. First operand 7254 states and 17144 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-09 20:02:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:02:36,032 INFO L93 Difference]: Finished difference Result 20021 states and 49326 transitions. [2024-11-09 20:02:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:02:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-11-09 20:02:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:02:36,067 INFO L225 Difference]: With dead ends: 20021 [2024-11-09 20:02:36,067 INFO L226 Difference]: Without dead ends: 14135 [2024-11-09 20:02:36,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:02:36,077 INFO L432 NwaCegarLoop]: 1803 mSDtfsCounter, 7631 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 14600 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7631 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 15931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 14600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:02:36,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7631 Valid, 2164 Invalid, 15931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 14600 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-09 20:02:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2024-11-09 20:02:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 14116. [2024-11-09 20:02:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14116 states, 14115 states have (on average 2.203542330853702) internal successors, (31103), 14115 states have internal predecessors, (31103), 0 states have call successors, (0), 0 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-09 20:02:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 31103 transitions. [2024-11-09 20:02:36,305 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 31103 transitions. Word has length 273 [2024-11-09 20:02:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:02:36,307 INFO L471 AbstractCegarLoop]: Abstraction has 14116 states and 31103 transitions. [2024-11-09 20:02:36,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-09 20:02:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 31103 transitions. [2024-11-09 20:02:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-09 20:02:36,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:02:36,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:02:36,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 20:02:36,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:02:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:02:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1783455268, now seen corresponding path program 1 times [2024-11-09 20:02:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:02:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64456384] [2024-11-09 20:02:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:02:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:02:36,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:02:36,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64456384] [2024-11-09 20:02:36,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64456384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:02:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:02:36,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:02:36,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948990308] [2024-11-09 20:02:36,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:02:36,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:02:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:02:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:02:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:02:36,890 INFO L87 Difference]: Start difference. First operand 14116 states and 31103 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-09 20:02:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:02:43,684 INFO L93 Difference]: Finished difference Result 25530 states and 56906 transitions. [2024-11-09 20:02:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:02:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 301 [2024-11-09 20:02:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:02:43,711 INFO L225 Difference]: With dead ends: 25530 [2024-11-09 20:02:43,711 INFO L226 Difference]: Without dead ends: 14116 [2024-11-09 20:02:43,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:02:43,727 INFO L432 NwaCegarLoop]: 1774 mSDtfsCounter, 2428 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 11187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2428 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 11195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-09 20:02:43,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2428 Valid, 2120 Invalid, 11195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11187 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-09 20:02:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14116 states. [2024-11-09 20:02:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14116 to 14116. [2024-11-09 20:02:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14116 states, 14115 states have (on average 2.2026213248317394) internal successors, (31090), 14115 states have internal predecessors, (31090), 0 states have call successors, (0), 0 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-09 20:02:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 31090 transitions. [2024-11-09 20:02:43,896 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 31090 transitions. Word has length 301 [2024-11-09 20:02:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:02:43,896 INFO L471 AbstractCegarLoop]: Abstraction has 14116 states and 31090 transitions. [2024-11-09 20:02:43,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-09 20:02:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 31090 transitions. [2024-11-09 20:02:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2024-11-09 20:02:43,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:02:43,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:02:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 20:02:43,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:02:43,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:02:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1699631581, now seen corresponding path program 1 times [2024-11-09 20:02:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:02:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653013566] [2024-11-09 20:02:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:02:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:02:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:02:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653013566] [2024-11-09 20:02:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653013566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:02:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:02:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:02:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766006422] [2024-11-09 20:02:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:02:44,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:02:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:02:44,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:02:44,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:02:44,252 INFO L87 Difference]: Start difference. First operand 14116 states and 31090 transitions. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-09 20:02:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:02:50,824 INFO L93 Difference]: Finished difference Result 28293 states and 64654 transitions. [2024-11-09 20:02:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:02:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 553 [2024-11-09 20:02:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:02:50,852 INFO L225 Difference]: With dead ends: 28293 [2024-11-09 20:02:50,853 INFO L226 Difference]: Without dead ends: 16911 [2024-11-09 20:02:50,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:02:50,867 INFO L432 NwaCegarLoop]: 4062 mSDtfsCounter, 2756 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 6649 mSolverCounterSat, 1802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2756 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 8451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1802 IncrementalHoareTripleChecker+Valid, 6649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-09 20:02:50,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2756 Valid, 4243 Invalid, 8451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1802 Valid, 6649 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-09 20:02:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16911 states. [2024-11-09 20:02:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16911 to 16867. [2024-11-09 20:02:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16867 states, 16866 states have (on average 2.213506462706036) internal successors, (37333), 16866 states have internal predecessors, (37333), 0 states have call successors, (0), 0 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-09 20:02:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 37333 transitions. [2024-11-09 20:02:51,057 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 37333 transitions. Word has length 553 [2024-11-09 20:02:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:02:51,060 INFO L471 AbstractCegarLoop]: Abstraction has 16867 states and 37333 transitions. [2024-11-09 20:02:51,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-09 20:02:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 37333 transitions. [2024-11-09 20:02:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2024-11-09 20:02:51,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:02:51,070 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:02:51,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 20:02:51,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:02:51,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:02:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -193188271, now seen corresponding path program 1 times [2024-11-09 20:02:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:02:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54288779] [2024-11-09 20:02:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:02:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 20:02:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:02:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54288779] [2024-11-09 20:02:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54288779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:02:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:02:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:02:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949456492] [2024-11-09 20:02:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:02:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:02:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:02:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:02:51,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:02:51,392 INFO L87 Difference]: Start difference. First operand 16867 states and 37333 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 2 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-09 20:02:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:02:57,868 INFO L93 Difference]: Finished difference Result 44852 states and 100987 transitions. [2024-11-09 20:02:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:02:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 2 states have internal predecessors, (555), 0 states have call successors, (0), 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 622 [2024-11-09 20:02:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:02:57,914 INFO L225 Difference]: With dead ends: 44852 [2024-11-09 20:02:57,915 INFO L226 Difference]: Without dead ends: 30719 [2024-11-09 20:02:57,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:02:57,932 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 3402 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 7697 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 8131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 7697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:02:57,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 992 Invalid, 8131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 7697 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 20:02:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30719 states. [2024-11-09 20:02:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30719 to 30715. [2024-11-09 20:02:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30715 states, 30714 states have (on average 2.214983395194374) internal successors, (68031), 30714 states have internal predecessors, (68031), 0 states have call successors, (0), 0 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-09 20:02:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30715 states to 30715 states and 68031 transitions. [2024-11-09 20:02:58,265 INFO L78 Accepts]: Start accepts. Automaton has 30715 states and 68031 transitions. Word has length 622 [2024-11-09 20:02:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:02:58,266 INFO L471 AbstractCegarLoop]: Abstraction has 30715 states and 68031 transitions. [2024-11-09 20:02:58,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 2 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-09 20:02:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 30715 states and 68031 transitions. [2024-11-09 20:02:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-11-09 20:02:58,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:02:58,274 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:02:58,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 20:02:58,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:02:58,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:02:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2055270299, now seen corresponding path program 1 times [2024-11-09 20:02:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:02:58,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705269189] [2024-11-09 20:02:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:02:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 123 proven. 38 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 20:02:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:02:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705269189] [2024-11-09 20:02:58,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705269189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:02:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193506088] [2024-11-09 20:02:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:02:58,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:02:58,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:02:58,915 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-09 20:02:58,916 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-09 20:02:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:02:59,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:02:59,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:02:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:02:59,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:02:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193506088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:02:59,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 20:02:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 20:02:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377847750] [2024-11-09 20:02:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:02:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:02:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:02:59,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:02:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:02:59,441 INFO L87 Difference]: Start difference. First operand 30715 states and 68031 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-09 20:03:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:03:05,925 INFO L93 Difference]: Finished difference Result 84637 states and 189856 transitions. [2024-11-09 20:03:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:03:05,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 649 [2024-11-09 20:03:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:03:05,996 INFO L225 Difference]: With dead ends: 84637 [2024-11-09 20:03:05,996 INFO L226 Difference]: Without dead ends: 56656 [2024-11-09 20:03:06,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:03:06,020 INFO L432 NwaCegarLoop]: 1564 mSDtfsCounter, 2849 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6493 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 8221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 6493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:03:06,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2849 Valid, 1702 Invalid, 8221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 6493 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 20:03:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56656 states. [2024-11-09 20:03:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56656 to 51192. [2024-11-09 20:03:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51192 states, 51191 states have (on average 2.138657185833447) internal successors, (109480), 51191 states have internal predecessors, (109480), 0 states have call successors, (0), 0 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-09 20:03:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51192 states to 51192 states and 109480 transitions. [2024-11-09 20:03:06,543 INFO L78 Accepts]: Start accepts. Automaton has 51192 states and 109480 transitions. Word has length 649 [2024-11-09 20:03:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:03:06,544 INFO L471 AbstractCegarLoop]: Abstraction has 51192 states and 109480 transitions. [2024-11-09 20:03:06,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-09 20:03:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 51192 states and 109480 transitions. [2024-11-09 20:03:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2024-11-09 20:03:06,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:03:06,556 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:03:06,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 20:03:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:03:06,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:03:06,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:03:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -718158454, now seen corresponding path program 1 times [2024-11-09 20:03:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:03:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128510230] [2024-11-09 20:03:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:03:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:03:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:03:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-09 20:03:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:03:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128510230] [2024-11-09 20:03:07,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128510230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:03:07,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:03:07,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:03:07,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697450470] [2024-11-09 20:03:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:03:07,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:03:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:03:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:03:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:03:07,165 INFO L87 Difference]: Start difference. First operand 51192 states and 109480 transitions. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 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-09 20:03:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:03:13,561 INFO L93 Difference]: Finished difference Result 116065 states and 249770 transitions. [2024-11-09 20:03:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:03:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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 766 [2024-11-09 20:03:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:03:13,643 INFO L225 Difference]: With dead ends: 116065 [2024-11-09 20:03:13,643 INFO L226 Difference]: Without dead ends: 67607 [2024-11-09 20:03:13,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:03:13,670 INFO L432 NwaCegarLoop]: 4367 mSDtfsCounter, 2641 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 7177 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 4559 SdHoareTripleChecker+Invalid, 8103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 7177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:03:13,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 4559 Invalid, 8103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 7177 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-09 20:03:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67607 states. [2024-11-09 20:03:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67607 to 67599. [2024-11-09 20:03:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67599 states, 67598 states have (on average 2.1089825142755703) internal successors, (142563), 67598 states have internal predecessors, (142563), 0 states have call successors, (0), 0 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-09 20:03:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67599 states to 67599 states and 142563 transitions. [2024-11-09 20:03:14,646 INFO L78 Accepts]: Start accepts. Automaton has 67599 states and 142563 transitions. Word has length 766 [2024-11-09 20:03:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:03:14,647 INFO L471 AbstractCegarLoop]: Abstraction has 67599 states and 142563 transitions. [2024-11-09 20:03:14,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 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-09 20:03:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 67599 states and 142563 transitions. [2024-11-09 20:03:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2024-11-09 20:03:14,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:03:14,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:03:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 20:03:14,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:03:14,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:03:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1577141141, now seen corresponding path program 1 times [2024-11-09 20:03:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:03:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192051291] [2024-11-09 20:03:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:03:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:03:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:03:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 146 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:03:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:03:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192051291] [2024-11-09 20:03:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192051291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:03:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852361273] [2024-11-09 20:03:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:03:15,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:03:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:03:15,796 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-09 20:03:15,797 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-09 20:03:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:03:16,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:03:16,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:03:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-09 20:03:16,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:03:16,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852361273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:03:16,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 20:03:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 20:03:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2737162] [2024-11-09 20:03:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:03:16,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:03:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:03:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:03:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:03:16,184 INFO L87 Difference]: Start difference. First operand 67599 states and 142563 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)