./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.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 42bba35470723c3ed0bb104994d7663c79c9e18425de9896b18a2c3627effd61 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:04:12,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:04:12,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:04:12,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:04:12,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:04:12,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:04:12,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:04:12,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:04:12,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:04:12,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:04:12,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:04:12,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:04:12,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:04:12,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:04:12,874 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:04:12,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:04:12,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:04:12,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:04:12,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:04:12,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:04:12,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:04:12,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:04:12,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:04:12,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:04:12,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:04:12,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:04:12,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:04:12,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:04:12,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:04:12,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:04:12,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:04:12,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:04:12,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:04:12,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:04:12,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:04:12,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:04:12,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:04:12,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:04:12,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:04:12,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:04:12,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:04:12,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:04:12,880 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 -> 42bba35470723c3ed0bb104994d7663c79c9e18425de9896b18a2c3627effd61 [2024-10-14 05:04:13,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:04:13,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:04:13,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:04:13,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:04:13,101 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:04:13,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-10-14 05:04:14,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:04:14,612 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:04:14,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-10-14 05:04:14,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81c2ae72/f70c62bce9304747aa424bc7ce8a648a/FLAG8941e4ed4 [2024-10-14 05:04:14,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81c2ae72/f70c62bce9304747aa424bc7ce8a648a [2024-10-14 05:04:14,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:04:14,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:04:14,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:04:14,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:04:14,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:04:14,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:04:14" (1/1) ... [2024-10-14 05:04:14,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160c5704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:14, skipping insertion in model container [2024-10-14 05:04:14,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:04:14" (1/1) ... [2024-10-14 05:04:14,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:04:15,205 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[20426,20439] [2024-10-14 05:04:15,244 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[27362,27375] [2024-10-14 05:04:15,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:04:15,749 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:04:15,785 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[20426,20439] [2024-10-14 05:04:15,794 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[27362,27375] [2024-10-14 05:04:16,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:04:16,160 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:04:16,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16 WrapperNode [2024-10-14 05:04:16,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:04:16,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:04:16,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:04:16,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:04:16,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,452 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5221 [2024-10-14 05:04:16,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:04:16,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:04:16,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:04:16,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:04:16,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,671 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 05:04:16,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:04:16,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:04:16,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:04:16,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:04:16,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (1/1) ... [2024-10-14 05:04:16,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:04:16,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:04:16,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:04:16,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:04:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:04:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:04:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:04:16,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:04:17,076 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:04:17,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:04:20,127 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-14 05:04:20,127 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:04:20,184 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:04:20,187 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 05:04:20,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:04:20 BoogieIcfgContainer [2024-10-14 05:04:20,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:04:20,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:04:20,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:04:20,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:04:20,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:04:14" (1/3) ... [2024-10-14 05:04:20,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139a1bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:04:20, skipping insertion in model container [2024-10-14 05:04:20,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:04:16" (2/3) ... [2024-10-14 05:04:20,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139a1bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:04:20, skipping insertion in model container [2024-10-14 05:04:20,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:04:20" (3/3) ... [2024-10-14 05:04:20,195 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-10-14 05:04:20,214 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:04:20,215 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:04:20,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:04:20,295 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;@238f135a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:04:20,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:04:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 865 states, 862 states have (on average 1.9721577726218098) internal successors, (1700), 864 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 05:04:20,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:20,317 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] [2024-10-14 05:04:20,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:20,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1979929519, now seen corresponding path program 1 times [2024-10-14 05:04:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:20,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551269691] [2024-10-14 05:04:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:20,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551269691] [2024-10-14 05:04:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551269691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:04:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571127813] [2024-10-14 05:04:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:20,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 05:04:20,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 05:04:20,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 05:04:20,567 INFO L87 Difference]: Start difference. First operand has 865 states, 862 states have (on average 1.9721577726218098) internal successors, (1700), 864 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:20,645 INFO L93 Difference]: Finished difference Result 1676 states and 3294 transitions. [2024-10-14 05:04:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 05:04:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-14 05:04:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:20,660 INFO L225 Difference]: With dead ends: 1676 [2024-10-14 05:04:20,661 INFO L226 Difference]: Without dead ends: 861 [2024-10-14 05:04:20,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 05:04:20,667 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:20,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1629 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-14 05:04:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-10-14 05:04:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.8963911525029105) internal successors, (1629), 860 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1629 transitions. [2024-10-14 05:04:20,727 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1629 transitions. Word has length 25 [2024-10-14 05:04:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:20,728 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1629 transitions. [2024-10-14 05:04:20,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1629 transitions. [2024-10-14 05:04:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 05:04:20,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:20,729 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] [2024-10-14 05:04:20,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:04:20,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1892335951, now seen corresponding path program 1 times [2024-10-14 05:04:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:20,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267098922] [2024-10-14 05:04:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:20,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267098922] [2024-10-14 05:04:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267098922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:20,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:04:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065533574] [2024-10-14 05:04:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:20,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:04:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:04:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:04:20,902 INFO L87 Difference]: Start difference. First operand 861 states and 1629 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:20,992 INFO L93 Difference]: Finished difference Result 917 states and 1718 transitions. [2024-10-14 05:04:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:04:20,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-14 05:04:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:20,997 INFO L225 Difference]: With dead ends: 917 [2024-10-14 05:04:20,997 INFO L226 Difference]: Without dead ends: 861 [2024-10-14 05:04:20,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:04:20,999 INFO L432 NwaCegarLoop]: 1626 mSDtfsCounter, 0 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:20,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4824 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:04:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-14 05:04:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-10-14 05:04:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.838183934807916) internal successors, (1579), 860 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1579 transitions. [2024-10-14 05:04:21,018 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1579 transitions. Word has length 25 [2024-10-14 05:04:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:21,018 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1579 transitions. [2024-10-14 05:04:21,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1579 transitions. [2024-10-14 05:04:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:04:21,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:21,020 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] [2024-10-14 05:04:21,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:04:21,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:21,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2121093177, now seen corresponding path program 1 times [2024-10-14 05:04:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170738917] [2024-10-14 05:04:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170738917] [2024-10-14 05:04:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170738917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:21,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:21,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593650340] [2024-10-14 05:04:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:21,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:04:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:04:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:04:21,207 INFO L87 Difference]: Start difference. First operand 861 states and 1579 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:25,818 INFO L93 Difference]: Finished difference Result 3116 states and 5888 transitions. [2024-10-14 05:04:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:04:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 05:04:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:25,826 INFO L225 Difference]: With dead ends: 3116 [2024-10-14 05:04:25,826 INFO L226 Difference]: Without dead ends: 2363 [2024-10-14 05:04:25,827 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-10-14 05:04:25,828 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 2462 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5521 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:25,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 848 Invalid, 6621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5521 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 05:04:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2024-10-14 05:04:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2024-10-14 05:04:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2361 states have (on average 1.5692503176620076) internal successors, (3705), 2362 states have internal predecessors, (3705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3705 transitions. [2024-10-14 05:04:25,865 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3705 transitions. Word has length 59 [2024-10-14 05:04:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:25,868 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3705 transitions. [2024-10-14 05:04:25,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3705 transitions. [2024-10-14 05:04:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 05:04:25,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:25,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:25,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:04:25,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:25,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1140961112, now seen corresponding path program 1 times [2024-10-14 05:04:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:25,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990463827] [2024-10-14 05:04:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:26,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990463827] [2024-10-14 05:04:26,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990463827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:26,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:26,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401686182] [2024-10-14 05:04:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:26,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:26,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:26,108 INFO L87 Difference]: Start difference. First operand 2363 states and 3705 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:26,444 INFO L93 Difference]: Finished difference Result 3105 states and 4909 transitions. [2024-10-14 05:04:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:04:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-14 05:04:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:26,454 INFO L225 Difference]: With dead ends: 3105 [2024-10-14 05:04:26,454 INFO L226 Difference]: Without dead ends: 3052 [2024-10-14 05:04:26,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-14 05:04:26,457 INFO L432 NwaCegarLoop]: 1572 mSDtfsCounter, 11475 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11475 SdHoareTripleChecker+Valid, 5036 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:26,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11475 Valid, 5036 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:04:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2024-10-14 05:04:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2414. [2024-10-14 05:04:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.570480928689884) internal successors, (3788), 2413 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3788 transitions. [2024-10-14 05:04:26,494 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3788 transitions. Word has length 74 [2024-10-14 05:04:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:26,496 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3788 transitions. [2024-10-14 05:04:26,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3788 transitions. [2024-10-14 05:04:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:04:26,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:26,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:26,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:04:26,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:26,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1369648648, now seen corresponding path program 1 times [2024-10-14 05:04:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:26,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022343471] [2024-10-14 05:04:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:26,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:26,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:26,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022343471] [2024-10-14 05:04:26,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022343471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502804381] [2024-10-14 05:04:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:26,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:26,576 INFO L87 Difference]: Start difference. First operand 2414 states and 3788 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:26,606 INFO L93 Difference]: Finished difference Result 2611 states and 4107 transitions. [2024-10-14 05:04:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:26,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-14 05:04:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:26,614 INFO L225 Difference]: With dead ends: 2611 [2024-10-14 05:04:26,614 INFO L226 Difference]: Without dead ends: 2507 [2024-10-14 05:04:26,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:26,616 INFO L432 NwaCegarLoop]: 1574 mSDtfsCounter, 1496 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:26,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1654 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2024-10-14 05:04:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2024-10-14 05:04:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2503 states have (on average 1.5717139432680782) internal successors, (3934), 2504 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3934 transitions. [2024-10-14 05:04:26,653 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3934 transitions. Word has length 76 [2024-10-14 05:04:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:26,653 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3934 transitions. [2024-10-14 05:04:26,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3934 transitions. [2024-10-14 05:04:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:04:26,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:26,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:26,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:04:26,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:26,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1367503696, now seen corresponding path program 1 times [2024-10-14 05:04:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667735316] [2024-10-14 05:04:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667735316] [2024-10-14 05:04:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667735316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763179233] [2024-10-14 05:04:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:26,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:26,987 INFO L87 Difference]: Start difference. First operand 2505 states and 3934 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:27,301 INFO L93 Difference]: Finished difference Result 2702 states and 4250 transitions. [2024-10-14 05:04:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:04:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-14 05:04:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:27,311 INFO L225 Difference]: With dead ends: 2702 [2024-10-14 05:04:27,311 INFO L226 Difference]: Without dead ends: 2507 [2024-10-14 05:04:27,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-14 05:04:27,315 INFO L432 NwaCegarLoop]: 1567 mSDtfsCounter, 1557 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:27,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 2148 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:04:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2024-10-14 05:04:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2024-10-14 05:04:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2503 states have (on average 1.570914902117459) internal successors, (3932), 2504 states have internal predecessors, (3932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3932 transitions. [2024-10-14 05:04:27,352 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3932 transitions. Word has length 76 [2024-10-14 05:04:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:27,352 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3932 transitions. [2024-10-14 05:04:27,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3932 transitions. [2024-10-14 05:04:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 05:04:27,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:27,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:04:27,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 428703861, now seen corresponding path program 1 times [2024-10-14 05:04:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75516391] [2024-10-14 05:04:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:27,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:27,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75516391] [2024-10-14 05:04:27,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75516391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:27,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:27,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:04:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058026101] [2024-10-14 05:04:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:27,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:04:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:04:27,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:04:27,485 INFO L87 Difference]: Start difference. First operand 2505 states and 3932 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:27,513 INFO L93 Difference]: Finished difference Result 2511 states and 3939 transitions. [2024-10-14 05:04:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:04:27,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 05:04:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:27,520 INFO L225 Difference]: With dead ends: 2511 [2024-10-14 05:04:27,520 INFO L226 Difference]: Without dead ends: 2509 [2024-10-14 05:04:27,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:04:27,521 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4717 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:27,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4717 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2024-10-14 05:04:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2509. [2024-10-14 05:04:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 1.5696051057040288) internal successors, (3935), 2508 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3935 transitions. [2024-10-14 05:04:27,551 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3935 transitions. Word has length 77 [2024-10-14 05:04:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:27,552 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3935 transitions. [2024-10-14 05:04:27,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3935 transitions. [2024-10-14 05:04:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:04:27,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:27,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:27,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:04:27,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1012840592, now seen corresponding path program 1 times [2024-10-14 05:04:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829987747] [2024-10-14 05:04:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:27,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:27,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829987747] [2024-10-14 05:04:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829987747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873906226] [2024-10-14 05:04:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:27,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:27,600 INFO L87 Difference]: Start difference. First operand 2509 states and 3935 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:27,626 INFO L93 Difference]: Finished difference Result 2719 states and 4268 transitions. [2024-10-14 05:04:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 05:04:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:27,633 INFO L225 Difference]: With dead ends: 2719 [2024-10-14 05:04:27,633 INFO L226 Difference]: Without dead ends: 2611 [2024-10-14 05:04:27,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:27,635 INFO L432 NwaCegarLoop]: 1646 mSDtfsCounter, 1514 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:27,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1732 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2024-10-14 05:04:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2609. [2024-10-14 05:04:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2607 states have (on average 1.5696202531645569) internal successors, (4092), 2608 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4092 transitions. [2024-10-14 05:04:27,669 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4092 transitions. Word has length 78 [2024-10-14 05:04:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:27,669 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4092 transitions. [2024-10-14 05:04:27,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4092 transitions. [2024-10-14 05:04:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:04:27,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:27,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:27,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:04:27,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -257456528, now seen corresponding path program 1 times [2024-10-14 05:04:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366714517] [2024-10-14 05:04:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:27,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:27,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366714517] [2024-10-14 05:04:27,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366714517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:27,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:27,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:27,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872582056] [2024-10-14 05:04:27,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:27,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:27,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:27,715 INFO L87 Difference]: Start difference. First operand 2609 states and 4092 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:27,746 INFO L93 Difference]: Finished difference Result 3179 states and 4992 transitions. [2024-10-14 05:04:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 05:04:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:27,753 INFO L225 Difference]: With dead ends: 3179 [2024-10-14 05:04:27,753 INFO L226 Difference]: Without dead ends: 2882 [2024-10-14 05:04:27,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:27,754 INFO L432 NwaCegarLoop]: 1648 mSDtfsCounter, 1512 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:27,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1738 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2024-10-14 05:04:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2880. [2024-10-14 05:04:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2878 states have (on average 1.5684503127171647) internal successors, (4514), 2879 states have internal predecessors, (4514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4514 transitions. [2024-10-14 05:04:27,796 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4514 transitions. Word has length 78 [2024-10-14 05:04:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:27,796 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4514 transitions. [2024-10-14 05:04:27,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4514 transitions. [2024-10-14 05:04:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:04:27,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:27,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:27,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:04:27,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash -667843216, now seen corresponding path program 1 times [2024-10-14 05:04:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496942482] [2024-10-14 05:04:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:27,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496942482] [2024-10-14 05:04:27,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496942482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:27,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:27,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791524927] [2024-10-14 05:04:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:27,843 INFO L87 Difference]: Start difference. First operand 2880 states and 4514 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:27,879 INFO L93 Difference]: Finished difference Result 3968 states and 6216 transitions. [2024-10-14 05:04:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:27,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 05:04:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:27,888 INFO L225 Difference]: With dead ends: 3968 [2024-10-14 05:04:27,888 INFO L226 Difference]: Without dead ends: 3400 [2024-10-14 05:04:27,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:27,890 INFO L432 NwaCegarLoop]: 1646 mSDtfsCounter, 1510 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:27,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1740 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2024-10-14 05:04:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3398. [2024-10-14 05:04:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3396 states have (on average 1.5636042402826855) internal successors, (5310), 3397 states have internal predecessors, (5310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 5310 transitions. [2024-10-14 05:04:27,941 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 5310 transitions. Word has length 78 [2024-10-14 05:04:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:27,941 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 5310 transitions. [2024-10-14 05:04:27,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 5310 transitions. [2024-10-14 05:04:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:04:27,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:27,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:27,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:04:27,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:27,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash -936426384, now seen corresponding path program 1 times [2024-10-14 05:04:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697132067] [2024-10-14 05:04:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:27,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:27,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697132067] [2024-10-14 05:04:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697132067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:27,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:27,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:27,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029537212] [2024-10-14 05:04:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:27,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:27,992 INFO L87 Difference]: Start difference. First operand 3398 states and 5310 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:28,039 INFO L93 Difference]: Finished difference Result 5474 states and 8520 transitions. [2024-10-14 05:04:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 05:04:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:28,048 INFO L225 Difference]: With dead ends: 5474 [2024-10-14 05:04:28,048 INFO L226 Difference]: Without dead ends: 4388 [2024-10-14 05:04:28,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:28,050 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 1508 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:28,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1742 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2024-10-14 05:04:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 4386. [2024-10-14 05:04:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4386 states, 4384 states have (on average 1.552463503649635) internal successors, (6806), 4385 states have internal predecessors, (6806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 6806 transitions. [2024-10-14 05:04:28,180 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 6806 transitions. Word has length 78 [2024-10-14 05:04:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:28,181 INFO L471 AbstractCegarLoop]: Abstraction has 4386 states and 6806 transitions. [2024-10-14 05:04:28,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 6806 transitions. [2024-10-14 05:04:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:04:28,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:28,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:28,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:04:28,183 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:28,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1522138512, now seen corresponding path program 1 times [2024-10-14 05:04:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829003132] [2024-10-14 05:04:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829003132] [2024-10-14 05:04:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829003132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:28,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:28,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548397446] [2024-10-14 05:04:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:28,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:28,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:28,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:28,246 INFO L87 Difference]: Start difference. First operand 4386 states and 6806 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:28,350 INFO L93 Difference]: Finished difference Result 8342 states and 12840 transitions. [2024-10-14 05:04:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:28,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 05:04:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:28,363 INFO L225 Difference]: With dead ends: 8342 [2024-10-14 05:04:28,363 INFO L226 Difference]: Without dead ends: 6268 [2024-10-14 05:04:28,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:28,367 INFO L432 NwaCegarLoop]: 1632 mSDtfsCounter, 1504 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:28,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1738 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2024-10-14 05:04:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6266. [2024-10-14 05:04:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 6264 states have (on average 1.5335249042145593) internal successors, (9606), 6265 states have internal predecessors, (9606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 9606 transitions. [2024-10-14 05:04:28,514 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 9606 transitions. Word has length 78 [2024-10-14 05:04:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:28,514 INFO L471 AbstractCegarLoop]: Abstraction has 6266 states and 9606 transitions. [2024-10-14 05:04:28,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 9606 transitions. [2024-10-14 05:04:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:04:28,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:28,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:28,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:04:28,516 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -633405072, now seen corresponding path program 1 times [2024-10-14 05:04:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049802032] [2024-10-14 05:04:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049802032] [2024-10-14 05:04:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049802032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592271771] [2024-10-14 05:04:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:28,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:28,576 INFO L87 Difference]: Start difference. First operand 6266 states and 9606 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:28,743 INFO L93 Difference]: Finished difference Result 13790 states and 20904 transitions. [2024-10-14 05:04:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 05:04:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:28,758 INFO L225 Difference]: With dead ends: 13790 [2024-10-14 05:04:28,758 INFO L226 Difference]: Without dead ends: 9836 [2024-10-14 05:04:28,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:28,765 INFO L432 NwaCegarLoop]: 1630 mSDtfsCounter, 1502 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:28,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1740 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2024-10-14 05:04:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 9834. [2024-10-14 05:04:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 9832 states have (on average 1.507526444263629) internal successors, (14822), 9833 states have internal predecessors, (14822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 14822 transitions. [2024-10-14 05:04:28,936 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 14822 transitions. Word has length 78 [2024-10-14 05:04:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:28,936 INFO L471 AbstractCegarLoop]: Abstraction has 9834 states and 14822 transitions. [2024-10-14 05:04:28,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 14822 transitions. [2024-10-14 05:04:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:04:28,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:28,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:28,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:04:28,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:28,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash -896482448, now seen corresponding path program 1 times [2024-10-14 05:04:28,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:28,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259252532] [2024-10-14 05:04:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:04:28,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:28,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259252532] [2024-10-14 05:04:28,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259252532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:28,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:28,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:04:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155366333] [2024-10-14 05:04:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:28,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:04:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:28,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:04:28,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:28,982 INFO L87 Difference]: Start difference. First operand 9834 states and 14822 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:29,250 INFO L93 Difference]: Finished difference Result 24110 states and 35880 transitions. [2024-10-14 05:04:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:04:29,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 05:04:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:29,277 INFO L225 Difference]: With dead ends: 24110 [2024-10-14 05:04:29,277 INFO L226 Difference]: Without dead ends: 16588 [2024-10-14 05:04:29,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:04:29,287 INFO L432 NwaCegarLoop]: 1642 mSDtfsCounter, 1506 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:29,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1744 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:04:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16588 states. [2024-10-14 05:04:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16588 to 16586. [2024-10-14 05:04:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16586 states, 16584 states have (on average 1.4764833574529668) internal successors, (24486), 16585 states have internal predecessors, (24486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16586 states to 16586 states and 24486 transitions. [2024-10-14 05:04:29,610 INFO L78 Accepts]: Start accepts. Automaton has 16586 states and 24486 transitions. Word has length 78 [2024-10-14 05:04:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:29,610 INFO L471 AbstractCegarLoop]: Abstraction has 16586 states and 24486 transitions. [2024-10-14 05:04:29,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16586 states and 24486 transitions. [2024-10-14 05:04:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:04:29,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:29,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:29,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:04:29,615 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:29,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash 758003716, now seen corresponding path program 1 times [2024-10-14 05:04:29,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:29,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578308861] [2024-10-14 05:04:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:29,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:04:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578308861] [2024-10-14 05:04:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578308861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469736051] [2024-10-14 05:04:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:29,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:29,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:29,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:29,800 INFO L87 Difference]: Start difference. First operand 16586 states and 24486 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:31,561 INFO L93 Difference]: Finished difference Result 115098 states and 168430 transitions. [2024-10-14 05:04:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:04:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 05:04:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:31,754 INFO L225 Difference]: With dead ends: 115098 [2024-10-14 05:04:31,754 INFO L226 Difference]: Without dead ends: 105112 [2024-10-14 05:04:31,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:04:31,783 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 9843 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9843 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:31,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9843 Valid, 4635 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:04:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105112 states. [2024-10-14 05:04:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105112 to 28746. [2024-10-14 05:04:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28746 states, 28744 states have (on average 1.4641664347342054) internal successors, (42086), 28745 states have internal predecessors, (42086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28746 states to 28746 states and 42086 transitions. [2024-10-14 05:04:33,035 INFO L78 Accepts]: Start accepts. Automaton has 28746 states and 42086 transitions. Word has length 100 [2024-10-14 05:04:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 28746 states and 42086 transitions. [2024-10-14 05:04:33,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 28746 states and 42086 transitions. [2024-10-14 05:04:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:04:33,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:33,040 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:33,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:04:33,040 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1513387780, now seen corresponding path program 1 times [2024-10-14 05:04:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701187349] [2024-10-14 05:04:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:04:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:33,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701187349] [2024-10-14 05:04:33,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701187349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:33,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:33,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:33,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564139972] [2024-10-14 05:04:33,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:33,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:33,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:33,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:33,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:33,387 INFO L87 Difference]: Start difference. First operand 28746 states and 42086 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:35,437 INFO L93 Difference]: Finished difference Result 129370 states and 189166 transitions. [2024-10-14 05:04:35,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:04:35,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 05:04:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:35,586 INFO L225 Difference]: With dead ends: 129370 [2024-10-14 05:04:35,587 INFO L226 Difference]: Without dead ends: 115096 [2024-10-14 05:04:35,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:04:35,616 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 9847 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9847 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:35,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9847 Valid, 4570 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:04:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115096 states. [2024-10-14 05:04:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115096 to 48010. [2024-10-14 05:04:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48010 states, 48008 states have (on average 1.4565489085152474) internal successors, (69926), 48009 states have internal predecessors, (69926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48010 states to 48010 states and 69926 transitions. [2024-10-14 05:04:37,468 INFO L78 Accepts]: Start accepts. Automaton has 48010 states and 69926 transitions. Word has length 100 [2024-10-14 05:04:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:37,469 INFO L471 AbstractCegarLoop]: Abstraction has 48010 states and 69926 transitions. [2024-10-14 05:04:37,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 48010 states and 69926 transitions. [2024-10-14 05:04:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:04:37,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:37,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:37,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:04:37,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:37,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1103001092, now seen corresponding path program 1 times [2024-10-14 05:04:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:37,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655517955] [2024-10-14 05:04:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 05:04:37,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:37,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655517955] [2024-10-14 05:04:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655517955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296496690] [2024-10-14 05:04:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:37,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:37,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:37,680 INFO L87 Difference]: Start difference. First operand 48010 states and 69926 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:40,638 INFO L93 Difference]: Finished difference Result 143642 states and 209838 transitions. [2024-10-14 05:04:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:04:40,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 05:04:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:40,795 INFO L225 Difference]: With dead ends: 143642 [2024-10-14 05:04:40,795 INFO L226 Difference]: Without dead ends: 129368 [2024-10-14 05:04:40,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:04:40,831 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 9866 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9866 SdHoareTripleChecker+Valid, 4536 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:40,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9866 Valid, 4536 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:04:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129368 states. [2024-10-14 05:04:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129368 to 62282. [2024-10-14 05:04:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62282 states, 62280 states have (on average 1.4546885035324342) internal successors, (90598), 62281 states have internal predecessors, (90598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62282 states to 62282 states and 90598 transitions. [2024-10-14 05:04:43,452 INFO L78 Accepts]: Start accepts. Automaton has 62282 states and 90598 transitions. Word has length 100 [2024-10-14 05:04:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 62282 states and 90598 transitions. [2024-10-14 05:04:43,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 62282 states and 90598 transitions. [2024-10-14 05:04:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:04:43,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:43,460 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:43,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:04:43,460 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:43,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 834417924, now seen corresponding path program 1 times [2024-10-14 05:04:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438411234] [2024-10-14 05:04:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 05:04:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438411234] [2024-10-14 05:04:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438411234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:43,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686720274] [2024-10-14 05:04:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:43,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:43,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:43,856 INFO L87 Difference]: Start difference. First operand 62282 states and 90598 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:47,162 INFO L93 Difference]: Finished difference Result 157914 states and 230510 transitions. [2024-10-14 05:04:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:04:47,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 05:04:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:47,345 INFO L225 Difference]: With dead ends: 157914 [2024-10-14 05:04:47,345 INFO L226 Difference]: Without dead ends: 143640 [2024-10-14 05:04:47,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:04:47,377 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 9955 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9955 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:47,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9955 Valid, 4453 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:04:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143640 states. [2024-10-14 05:04:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143640 to 76554. [2024-10-14 05:04:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76554 states, 76552 states have (on average 1.45352178911067) internal successors, (111270), 76553 states have internal predecessors, (111270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76554 states to 76554 states and 111270 transitions. [2024-10-14 05:04:50,491 INFO L78 Accepts]: Start accepts. Automaton has 76554 states and 111270 transitions. Word has length 100 [2024-10-14 05:04:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:50,492 INFO L471 AbstractCegarLoop]: Abstraction has 76554 states and 111270 transitions. [2024-10-14 05:04:50,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 76554 states and 111270 transitions. [2024-10-14 05:04:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:04:50,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:50,498 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:50,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:04:50,498 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 248705796, now seen corresponding path program 1 times [2024-10-14 05:04:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94374715] [2024-10-14 05:04:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 05:04:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94374715] [2024-10-14 05:04:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94374715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:50,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:50,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:50,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453332922] [2024-10-14 05:04:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:50,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:50,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:50,633 INFO L87 Difference]: Start difference. First operand 76554 states and 111270 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:04:55,018 INFO L93 Difference]: Finished difference Result 172186 states and 251182 transitions. [2024-10-14 05:04:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:04:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 05:04:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:04:55,196 INFO L225 Difference]: With dead ends: 172186 [2024-10-14 05:04:55,196 INFO L226 Difference]: Without dead ends: 157912 [2024-10-14 05:04:55,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:04:55,227 INFO L432 NwaCegarLoop]: 1653 mSDtfsCounter, 10038 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10038 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:04:55,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10038 Valid, 4489 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:04:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157912 states. [2024-10-14 05:04:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157912 to 90826. [2024-10-14 05:04:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90826 states, 90824 states have (on average 1.4527217475557122) internal successors, (131942), 90825 states have internal predecessors, (131942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90826 states to 90826 states and 131942 transitions. [2024-10-14 05:04:58,251 INFO L78 Accepts]: Start accepts. Automaton has 90826 states and 131942 transitions. Word has length 100 [2024-10-14 05:04:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:04:58,252 INFO L471 AbstractCegarLoop]: Abstraction has 90826 states and 131942 transitions. [2024-10-14 05:04:58,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:04:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 90826 states and 131942 transitions. [2024-10-14 05:04:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:04:58,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:04:58,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:04:58,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:04:58,259 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:04:58,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:04:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1137439236, now seen corresponding path program 1 times [2024-10-14 05:04:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:04:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587928048] [2024-10-14 05:04:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:04:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:04:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:04:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:04:58,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:04:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587928048] [2024-10-14 05:04:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587928048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:04:58,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:04:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:04:58,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325223498] [2024-10-14 05:04:58,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:04:58,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:04:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:04:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:04:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:04:58,416 INFO L87 Difference]: Start difference. First operand 90826 states and 131942 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:05:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:05:03,068 INFO L93 Difference]: Finished difference Result 186458 states and 271854 transitions. [2024-10-14 05:05:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:05:03,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 05:05:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:05:03,269 INFO L225 Difference]: With dead ends: 186458 [2024-10-14 05:05:03,269 INFO L226 Difference]: Without dead ends: 172184 [2024-10-14 05:05:03,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:05:03,306 INFO L432 NwaCegarLoop]: 1653 mSDtfsCounter, 9909 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9909 SdHoareTripleChecker+Valid, 4520 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:05:03,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9909 Valid, 4520 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:05:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172184 states. [2024-10-14 05:05:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172184 to 105098. [2024-10-14 05:05:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105098 states, 105096 states have (on average 1.4521389967268021) internal successors, (152614), 105097 states have internal predecessors, (152614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:05:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105098 states to 105098 states and 152614 transitions. [2024-10-14 05:05:07,156 INFO L78 Accepts]: Start accepts. Automaton has 105098 states and 152614 transitions. Word has length 100 [2024-10-14 05:05:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:05:07,156 INFO L471 AbstractCegarLoop]: Abstraction has 105098 states and 152614 transitions. [2024-10-14 05:05:07,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:05:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 105098 states and 152614 transitions. [2024-10-14 05:05:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:05:07,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:05:07,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:05:07,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:05:07,162 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:05:07,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:05:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash 874361860, now seen corresponding path program 1 times [2024-10-14 05:05:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:05:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995498987] [2024-10-14 05:05:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:05:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:05:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:05:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 05:05:07,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:05:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995498987] [2024-10-14 05:05:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995498987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:05:07,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:05:07,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:05:07,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967665676] [2024-10-14 05:05:07,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:05:07,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:05:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:05:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:05:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:05:07,507 INFO L87 Difference]: Start difference. First operand 105098 states and 152614 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)