./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.8.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.8.ufo.UNBOUNDED.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 5f8c8484e54a4d715d6771fe823761e162b84321aa9b0770845c5d1629fcdad3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:39:21,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:39:21,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:39:21,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:39:21,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:39:21,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:39:21,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:39:21,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:39:21,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:39:21,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:39:21,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:39:21,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:39:21,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:39:21,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:39:21,735 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:39:21,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:39:21,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:39:21,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:39:21,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:39:21,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:39:21,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:39:21,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:39:21,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:39:21,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:39:21,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:39:21,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:39:21,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:39:21,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:39:21,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:39:21,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:39:21,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:39:21,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:39:21,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:39:21,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:39:21,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:39:21,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:39:21,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:39:21,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:39:21,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:39:21,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:39:21,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:39:21,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:39:21,750 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 -> 5f8c8484e54a4d715d6771fe823761e162b84321aa9b0770845c5d1629fcdad3 [2024-10-12 21:39:21,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:39:22,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:39:22,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:39:22,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:39:22,024 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:39:22,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-12 21:39:23,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:39:23,894 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:39:23,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-12 21:39:23,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13a59063/8b52884b5d0e4b2ca7134ec9cbb80fb6/FLAG1abe58c43 [2024-10-12 21:39:23,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13a59063/8b52884b5d0e4b2ca7134ec9cbb80fb6 [2024-10-12 21:39:23,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:39:23,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:39:23,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:39:23,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:39:23,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:39:23,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:39:23" (1/1) ... [2024-10-12 21:39:23,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8613a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:23, skipping insertion in model container [2024-10-12 21:39:23,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:39:23" (1/1) ... [2024-10-12 21:39:24,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:39:24,500 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.8.ufo.UNBOUNDED.pals+Problem12_label05.c[26888,26901] [2024-10-12 21:39:24,559 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.8.ufo.UNBOUNDED.pals+Problem12_label05.c[33824,33837] [2024-10-12 21:39:25,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:39:25,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:39:25,249 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.8.ufo.UNBOUNDED.pals+Problem12_label05.c[26888,26901] [2024-10-12 21:39:25,262 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.8.ufo.UNBOUNDED.pals+Problem12_label05.c[33824,33837] [2024-10-12 21:39:25,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:39:25,728 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:39:25,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25 WrapperNode [2024-10-12 21:39:25,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:39:25,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:39:25,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:39:25,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:39:25,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:25,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,138 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-10-12 21:39:26,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:39:26,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:39:26,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:39:26,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:39:26,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,371 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-12 21:39:26,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:39:26,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:39:26,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:39:26,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:39:26,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (1/1) ... [2024-10-12 21:39:26,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:39:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:39:26,722 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-12 21:39:26,725 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-12 21:39:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:39:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:39:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:39:26,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:39:26,953 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:39:26,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:39:31,269 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-12 21:39:31,270 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:39:31,339 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:39:31,340 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:39:31,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:39:31 BoogieIcfgContainer [2024-10-12 21:39:31,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:39:31,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:39:31,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:39:31,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:39:31,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:39:23" (1/3) ... [2024-10-12 21:39:31,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b797604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:39:31, skipping insertion in model container [2024-10-12 21:39:31,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:25" (2/3) ... [2024-10-12 21:39:31,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b797604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:39:31, skipping insertion in model container [2024-10-12 21:39:31,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:39:31" (3/3) ... [2024-10-12 21:39:31,351 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-12 21:39:31,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:39:31,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:39:31,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:39:31,465 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;@3666cb0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:39:31,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:39:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 0 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-12 21:39:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 21:39:31,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:31,488 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] [2024-10-12 21:39:31,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:31,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1451363693, now seen corresponding path program 1 times [2024-10-12 21:39:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:31,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699874084] [2024-10-12 21:39:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:31,838 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-12 21:39:31,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699874084] [2024-10-12 21:39:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699874084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:39:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667959364] [2024-10-12 21:39:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:31,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:39:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:31,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:39:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:39:31,869 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-12 21:39:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:31,986 INFO L93 Difference]: Finished difference Result 1702 states and 3341 transitions. [2024-10-12 21:39:31,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:39:31,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-12 21:39:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:32,006 INFO L225 Difference]: With dead ends: 1702 [2024-10-12 21:39:32,007 INFO L226 Difference]: Without dead ends: 880 [2024-10-12 21:39:32,012 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-12 21:39:32,015 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:32,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1663 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-12 21:39:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-12 21:39:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8952164009111618) internal successors, (1664), 879 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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-12 21:39:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2024-10-12 21:39:32,135 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 27 [2024-10-12 21:39:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:32,136 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2024-10-12 21:39:32,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-12 21:39:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2024-10-12 21:39:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 21:39:32,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:32,139 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] [2024-10-12 21:39:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:39:32,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1038165269, now seen corresponding path program 1 times [2024-10-12 21:39:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395929899] [2024-10-12 21:39:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:32,384 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-12 21:39:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395929899] [2024-10-12 21:39:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395929899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:39:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364596150] [2024-10-12 21:39:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:39:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:39:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:32,390 INFO L87 Difference]: Start difference. First operand 880 states and 1664 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-12 21:39:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:32,526 INFO L93 Difference]: Finished difference Result 944 states and 1766 transitions. [2024-10-12 21:39:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:39:32,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-12 21:39:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:32,531 INFO L225 Difference]: With dead ends: 944 [2024-10-12 21:39:32,531 INFO L226 Difference]: Without dead ends: 880 [2024-10-12 21:39:32,532 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-12 21:39:32,533 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:32,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4918 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:39:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-12 21:39:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-12 21:39:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.825740318906606) internal successors, (1603), 879 states have internal predecessors, (1603), 0 states have call successors, (0), 0 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-12 21:39:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1603 transitions. [2024-10-12 21:39:32,556 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1603 transitions. Word has length 27 [2024-10-12 21:39:32,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:32,557 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1603 transitions. [2024-10-12 21:39:32,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-12 21:39:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1603 transitions. [2024-10-12 21:39:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:39:32,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:32,559 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-12 21:39:32,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:39:32,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:32,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1445962365, now seen corresponding path program 1 times [2024-10-12 21:39:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303741446] [2024-10-12 21:39:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:32,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-12 21:39:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303741446] [2024-10-12 21:39:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303741446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:32,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613704022] [2024-10-12 21:39:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:32,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:39:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:39:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:32,847 INFO L87 Difference]: Start difference. First operand 880 states and 1603 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-12 21:39:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:38,760 INFO L93 Difference]: Finished difference Result 3135 states and 5912 transitions. [2024-10-12 21:39:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:39:38,761 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-12 21:39:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:38,771 INFO L225 Difference]: With dead ends: 3135 [2024-10-12 21:39:38,771 INFO L226 Difference]: Without dead ends: 2382 [2024-10-12 21:39:38,773 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-12 21:39:38,774 INFO L432 NwaCegarLoop]: 836 mSDtfsCounter, 2522 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 6510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:38,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2522 Valid, 854 Invalid, 6510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-12 21:39:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2024-10-12 21:39:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2382. [2024-10-12 21:39:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2380 states have (on average 1.561764705882353) internal successors, (3717), 2381 states have internal predecessors, (3717), 0 states have call successors, (0), 0 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-12 21:39:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3717 transitions. [2024-10-12 21:39:38,832 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3717 transitions. Word has length 59 [2024-10-12 21:39:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:38,832 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 3717 transitions. [2024-10-12 21:39:38,833 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-12 21:39:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3717 transitions. [2024-10-12 21:39:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 21:39:38,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:38,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:38,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:39:38,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:38,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash 64149573, now seen corresponding path program 1 times [2024-10-12 21:39:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167842772] [2024-10-12 21:39:38,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:39,297 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-12 21:39:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:39,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167842772] [2024-10-12 21:39:39,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167842772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:39,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459928079] [2024-10-12 21:39:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:39,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:39,299 INFO L87 Difference]: Start difference. First operand 2382 states and 3717 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-12 21:39:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:39,851 INFO L93 Difference]: Finished difference Result 3358 states and 5301 transitions. [2024-10-12 21:39:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:39:39,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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 87 [2024-10-12 21:39:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:39,866 INFO L225 Difference]: With dead ends: 3358 [2024-10-12 21:39:39,867 INFO L226 Difference]: Without dead ends: 3297 [2024-10-12 21:39:39,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-12 21:39:39,869 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 13544 mSDsluCounter, 3889 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13544 SdHoareTripleChecker+Valid, 5483 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:39,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13544 Valid, 5483 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:39:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2024-10-12 21:39:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2441. [2024-10-12 21:39:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5633456334563345) internal successors, (3813), 2440 states have internal predecessors, (3813), 0 states have call successors, (0), 0 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-12 21:39:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3813 transitions. [2024-10-12 21:39:39,982 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3813 transitions. Word has length 87 [2024-10-12 21:39:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:39,984 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3813 transitions. [2024-10-12 21:39:39,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-12 21:39:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3813 transitions. [2024-10-12 21:39:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:39:39,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:39,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:39,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:39:39,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:39,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1377991541, now seen corresponding path program 1 times [2024-10-12 21:39:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:39,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076513667] [2024-10-12 21:39:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:39,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:40,147 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-12 21:39:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076513667] [2024-10-12 21:39:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076513667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:40,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:40,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242166820] [2024-10-12 21:39:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:40,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:40,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:40,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:40,149 INFO L87 Difference]: Start difference. First operand 2441 states and 3813 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:40,196 INFO L93 Difference]: Finished difference Result 2670 states and 4184 transitions. [2024-10-12 21:39:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:40,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-12 21:39:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:40,206 INFO L225 Difference]: With dead ends: 2670 [2024-10-12 21:39:40,207 INFO L226 Difference]: Without dead ends: 2550 [2024-10-12 21:39:40,208 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-12 21:39:40,209 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1506 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:40,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1687 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2024-10-12 21:39:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2546. [2024-10-12 21:39:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5648584905660377) internal successors, (3981), 2545 states have internal predecessors, (3981), 0 states have call successors, (0), 0 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-12 21:39:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3981 transitions. [2024-10-12 21:39:40,259 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3981 transitions. Word has length 89 [2024-10-12 21:39:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:40,259 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3981 transitions. [2024-10-12 21:39:40,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3981 transitions. [2024-10-12 21:39:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:39:40,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:40,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:40,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:39:40,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:40,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1380136493, now seen corresponding path program 1 times [2024-10-12 21:39:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:40,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976415975] [2024-10-12 21:39:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:40,789 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-12 21:39:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976415975] [2024-10-12 21:39:40,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976415975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:40,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:40,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:40,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449224622] [2024-10-12 21:39:40,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:40,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:40,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:40,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:40,793 INFO L87 Difference]: Start difference. First operand 2546 states and 3981 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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-12 21:39:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:41,283 INFO L93 Difference]: Finished difference Result 2773 states and 4345 transitions. [2024-10-12 21:39:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-12 21:39:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:41,293 INFO L225 Difference]: With dead ends: 2773 [2024-10-12 21:39:41,293 INFO L226 Difference]: Without dead ends: 2548 [2024-10-12 21:39:41,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:39:41,295 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 9126 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9126 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:41,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9126 Valid, 2261 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:39:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-10-12 21:39:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2024-10-12 21:39:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.564072327044025) internal successors, (3979), 2545 states have internal predecessors, (3979), 0 states have call successors, (0), 0 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-12 21:39:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3979 transitions. [2024-10-12 21:39:41,340 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3979 transitions. Word has length 89 [2024-10-12 21:39:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:41,341 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3979 transitions. [2024-10-12 21:39:41,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 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-12 21:39:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3979 transitions. [2024-10-12 21:39:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 21:39:41,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:41,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:41,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:39:41,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:41,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash -294343871, now seen corresponding path program 1 times [2024-10-12 21:39:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867947265] [2024-10-12 21:39:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:41,542 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-12 21:39:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867947265] [2024-10-12 21:39:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867947265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:41,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:41,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:39:41,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609063287] [2024-10-12 21:39:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:41,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:39:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:41,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:39:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:41,544 INFO L87 Difference]: Start difference. First operand 2546 states and 3979 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:41,584 INFO L93 Difference]: Finished difference Result 2552 states and 3986 transitions. [2024-10-12 21:39:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:39:41,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-12 21:39:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:41,593 INFO L225 Difference]: With dead ends: 2552 [2024-10-12 21:39:41,593 INFO L226 Difference]: Without dead ends: 2550 [2024-10-12 21:39:41,594 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-12 21:39:41,594 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4789 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-12 21:39:41,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4789 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2024-10-12 21:39:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2550. [2024-10-12 21:39:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2548 states have (on average 1.5627943485086342) internal successors, (3982), 2549 states have internal predecessors, (3982), 0 states have call successors, (0), 0 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-12 21:39:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3982 transitions. [2024-10-12 21:39:41,640 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3982 transitions. Word has length 90 [2024-10-12 21:39:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:41,641 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 3982 transitions. [2024-10-12 21:39:41,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3982 transitions. [2024-10-12 21:39:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:41,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:41,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:41,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:39:41,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:41,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1953031475, now seen corresponding path program 1 times [2024-10-12 21:39:41,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:41,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818583721] [2024-10-12 21:39:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:41,770 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-12 21:39:41,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:41,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818583721] [2024-10-12 21:39:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818583721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055295854] [2024-10-12 21:39:41,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:41,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:41,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:41,773 INFO L87 Difference]: Start difference. First operand 2550 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:41,811 INFO L93 Difference]: Finished difference Result 2992 states and 4682 transitions. [2024-10-12 21:39:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:41,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:41,821 INFO L225 Difference]: With dead ends: 2992 [2024-10-12 21:39:41,821 INFO L226 Difference]: Without dead ends: 2763 [2024-10-12 21:39:41,822 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-12 21:39:41,823 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1525 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1778 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-12 21:39:41,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2024-10-12 21:39:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2761. [2024-10-12 21:39:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2759 states have (on average 1.563247553461399) internal successors, (4313), 2760 states have internal predecessors, (4313), 0 states have call successors, (0), 0 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-12 21:39:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4313 transitions. [2024-10-12 21:39:41,876 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4313 transitions. Word has length 91 [2024-10-12 21:39:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:41,876 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4313 transitions. [2024-10-12 21:39:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4313 transitions. [2024-10-12 21:39:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:41,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:41,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:41,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:39:41,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:41,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1197647411, now seen corresponding path program 1 times [2024-10-12 21:39:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978015453] [2024-10-12 21:39:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:41,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:41,973 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-12 21:39:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978015453] [2024-10-12 21:39:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978015453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:41,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228099124] [2024-10-12 21:39:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:41,976 INFO L87 Difference]: Start difference. First operand 2761 states and 4313 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:42,021 INFO L93 Difference]: Finished difference Result 3609 states and 5647 transitions. [2024-10-12 21:39:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:42,031 INFO L225 Difference]: With dead ends: 3609 [2024-10-12 21:39:42,031 INFO L226 Difference]: Without dead ends: 3169 [2024-10-12 21:39:42,033 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-12 21:39:42,033 INFO L432 NwaCegarLoop]: 1673 mSDtfsCounter, 1523 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1780 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-12 21:39:42,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2024-10-12 21:39:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 3167. [2024-10-12 21:39:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3165 states have (on average 1.5617693522906793) internal successors, (4943), 3166 states have internal predecessors, (4943), 0 states have call successors, (0), 0 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-12 21:39:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4943 transitions. [2024-10-12 21:39:42,096 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4943 transitions. Word has length 91 [2024-10-12 21:39:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:42,097 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 4943 transitions. [2024-10-12 21:39:42,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4943 transitions. [2024-10-12 21:39:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:42,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:42,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:42,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:39:42,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:42,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1876617267, now seen corresponding path program 1 times [2024-10-12 21:39:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:42,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110751406] [2024-10-12 21:39:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:42,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:42,176 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-12 21:39:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110751406] [2024-10-12 21:39:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110751406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:42,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:42,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699082229] [2024-10-12 21:39:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:42,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:42,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:42,177 INFO L87 Difference]: Start difference. First operand 3167 states and 4943 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:42,228 INFO L93 Difference]: Finished difference Result 4795 states and 7481 transitions. [2024-10-12 21:39:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:42,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:42,245 INFO L225 Difference]: With dead ends: 4795 [2024-10-12 21:39:42,245 INFO L226 Difference]: Without dead ends: 3949 [2024-10-12 21:39:42,248 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-12 21:39:42,252 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1519 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1776 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-12 21:39:42,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1776 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2024-10-12 21:39:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3947. [2024-10-12 21:39:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3945 states have (on average 1.5561470215462612) internal successors, (6139), 3946 states have internal predecessors, (6139), 0 states have call successors, (0), 0 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-12 21:39:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 6139 transitions. [2024-10-12 21:39:42,335 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 6139 transitions. Word has length 91 [2024-10-12 21:39:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:42,335 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 6139 transitions. [2024-10-12 21:39:42,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 6139 transitions. [2024-10-12 21:39:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:42,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:42,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:39:42,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:42,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1836673331, now seen corresponding path program 1 times [2024-10-12 21:39:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608520271] [2024-10-12 21:39:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:42,416 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-12 21:39:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608520271] [2024-10-12 21:39:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608520271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319820648] [2024-10-12 21:39:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:42,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:42,419 INFO L87 Difference]: Start difference. First operand 3947 states and 6139 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:42,498 INFO L93 Difference]: Finished difference Result 7071 states and 10957 transitions. [2024-10-12 21:39:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:42,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:42,509 INFO L225 Difference]: With dead ends: 7071 [2024-10-12 21:39:42,510 INFO L226 Difference]: Without dead ends: 5445 [2024-10-12 21:39:42,512 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-12 21:39:42,513 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1517 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1778 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-12 21:39:42,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5445 states. [2024-10-12 21:39:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5445 to 5443. [2024-10-12 21:39:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 5441 states have (on average 1.5443852233045396) internal successors, (8403), 5442 states have internal predecessors, (8403), 0 states have call successors, (0), 0 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-12 21:39:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 8403 transitions. [2024-10-12 21:39:42,639 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 8403 transitions. Word has length 91 [2024-10-12 21:39:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:42,640 INFO L471 AbstractCegarLoop]: Abstraction has 5443 states and 8403 transitions. [2024-10-12 21:39:42,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 8403 transitions. [2024-10-12 21:39:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:42,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:42,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:42,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:39:42,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:42,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1573595955, now seen corresponding path program 1 times [2024-10-12 21:39:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722197397] [2024-10-12 21:39:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:42,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722197397] [2024-10-12 21:39:42,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722197397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:42,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:42,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132184886] [2024-10-12 21:39:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:42,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:42,724 INFO L87 Difference]: Start difference. First operand 5443 states and 8403 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:42,846 INFO L93 Difference]: Finished difference Result 11431 states and 17525 transitions. [2024-10-12 21:39:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:42,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:42,863 INFO L225 Difference]: With dead ends: 11431 [2024-10-12 21:39:42,863 INFO L226 Difference]: Without dead ends: 8309 [2024-10-12 21:39:42,869 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-12 21:39:42,870 INFO L432 NwaCegarLoop]: 1647 mSDtfsCounter, 1513 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1774 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-12 21:39:42,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1774 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states. [2024-10-12 21:39:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 8307. [2024-10-12 21:39:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8307 states, 8305 states have (on average 1.5261890427453342) internal successors, (12675), 8306 states have internal predecessors, (12675), 0 states have call successors, (0), 0 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-12 21:39:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 12675 transitions. [2024-10-12 21:39:43,121 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 12675 transitions. Word has length 91 [2024-10-12 21:39:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:43,121 INFO L471 AbstractCegarLoop]: Abstraction has 8307 states and 12675 transitions. [2024-10-12 21:39:43,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 12675 transitions. [2024-10-12 21:39:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:43,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:43,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:43,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:39:43,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1832637901, now seen corresponding path program 1 times [2024-10-12 21:39:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:43,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185420808] [2024-10-12 21:39:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:43,210 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-12 21:39:43,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:43,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185420808] [2024-10-12 21:39:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185420808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:43,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113555204] [2024-10-12 21:39:43,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:43,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:43,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:43,212 INFO L87 Difference]: Start difference. First operand 8307 states and 12675 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:43,413 INFO L93 Difference]: Finished difference Result 19767 states and 29893 transitions. [2024-10-12 21:39:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:43,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:43,442 INFO L225 Difference]: With dead ends: 19767 [2024-10-12 21:39:43,443 INFO L226 Difference]: Without dead ends: 13781 [2024-10-12 21:39:43,454 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-12 21:39:43,455 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 1515 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1780 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-12 21:39:43,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13781 states. [2024-10-12 21:39:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13781 to 13779. [2024-10-12 21:39:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13779 states, 13777 states have (on average 1.503012266821514) internal successors, (20707), 13778 states have internal predecessors, (20707), 0 states have call successors, (0), 0 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-12 21:39:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13779 states to 13779 states and 20707 transitions. [2024-10-12 21:39:43,803 INFO L78 Accepts]: Start accepts. Automaton has 13779 states and 20707 transitions. Word has length 91 [2024-10-12 21:39:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:43,803 INFO L471 AbstractCegarLoop]: Abstraction has 13779 states and 20707 transitions. [2024-10-12 21:39:43,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 13779 states and 20707 transitions. [2024-10-12 21:39:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:43,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:43,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:43,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:39:43,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:43,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1608034099, now seen corresponding path program 1 times [2024-10-12 21:39:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580599169] [2024-10-12 21:39:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:43,889 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-12 21:39:43,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580599169] [2024-10-12 21:39:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580599169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:43,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:43,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050066160] [2024-10-12 21:39:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:43,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:43,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:43,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:43,891 INFO L87 Difference]: Start difference. First operand 13779 states and 20707 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:44,437 INFO L93 Difference]: Finished difference Result 35671 states and 53093 transitions. [2024-10-12 21:39:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:44,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:44,488 INFO L225 Difference]: With dead ends: 35671 [2024-10-12 21:39:44,489 INFO L226 Difference]: Without dead ends: 24213 [2024-10-12 21:39:44,510 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-12 21:39:44,511 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1521 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1782 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-12 21:39:44,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1782 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24213 states. [2024-10-12 21:39:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24213 to 24211. [2024-10-12 21:39:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24211 states, 24209 states have (on average 1.4765996117146516) internal successors, (35747), 24210 states have internal predecessors, (35747), 0 states have call successors, (0), 0 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-12 21:39:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24211 states to 24211 states and 35747 transitions. [2024-10-12 21:39:45,146 INFO L78 Accepts]: Start accepts. Automaton has 24211 states and 35747 transitions. Word has length 91 [2024-10-12 21:39:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:45,147 INFO L471 AbstractCegarLoop]: Abstraction has 24211 states and 35747 transitions. [2024-10-12 21:39:45,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 24211 states and 35747 transitions. [2024-10-12 21:39:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 21:39:45,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:45,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:45,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:39:45,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:45,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1270173042, now seen corresponding path program 1 times [2024-10-12 21:39:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128501155] [2024-10-12 21:39:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:45,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:45,297 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-12 21:39:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:45,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128501155] [2024-10-12 21:39:45,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128501155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:45,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:45,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593191341] [2024-10-12 21:39:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:45,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:45,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:45,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:45,299 INFO L87 Difference]: Start difference. First operand 24211 states and 35747 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:45,835 INFO L93 Difference]: Finished difference Result 46746 states and 69289 transitions. [2024-10-12 21:39:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-12 21:39:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:45,915 INFO L225 Difference]: With dead ends: 46746 [2024-10-12 21:39:45,916 INFO L226 Difference]: Without dead ends: 34711 [2024-10-12 21:39:45,943 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-12 21:39:45,943 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1524 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1779 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-12 21:39:45,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34711 states. [2024-10-12 21:39:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34711 to 34709. [2024-10-12 21:39:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34709 states, 34707 states have (on average 1.4688967643414874) internal successors, (50981), 34708 states have internal predecessors, (50981), 0 states have call successors, (0), 0 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-12 21:39:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34709 states to 34709 states and 50981 transitions. [2024-10-12 21:39:47,257 INFO L78 Accepts]: Start accepts. Automaton has 34709 states and 50981 transitions. Word has length 93 [2024-10-12 21:39:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:47,257 INFO L471 AbstractCegarLoop]: Abstraction has 34709 states and 50981 transitions. [2024-10-12 21:39:47,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34709 states and 50981 transitions. [2024-10-12 21:39:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:47,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:47,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:47,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:39:47,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:47,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2131163920, now seen corresponding path program 1 times [2024-10-12 21:39:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:47,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563909473] [2024-10-12 21:39:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:39:47,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:47,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563909473] [2024-10-12 21:39:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563909473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:47,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:47,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466694789] [2024-10-12 21:39:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:47,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:47,545 INFO L87 Difference]: Start difference. First operand 34709 states and 50981 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-12 21:39:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:52,435 INFO L93 Difference]: Finished difference Result 300199 states and 438958 transitions. [2024-10-12 21:39:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:52,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 115 [2024-10-12 21:39:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:53,100 INFO L225 Difference]: With dead ends: 300199 [2024-10-12 21:39:53,100 INFO L226 Difference]: Without dead ends: 267813 [2024-10-12 21:39:53,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:39:53,402 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 11812 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11812 SdHoareTripleChecker+Valid, 4926 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:53,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11812 Valid, 4926 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:39:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267813 states. [2024-10-12 21:39:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267813 to 67093. [2024-10-12 21:39:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67093 states, 67091 states have (on average 1.460061707233459) internal successors, (97957), 67092 states have internal predecessors, (97957), 0 states have call successors, (0), 0 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-12 21:39:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67093 states to 67093 states and 97957 transitions. [2024-10-12 21:39:57,176 INFO L78 Accepts]: Start accepts. Automaton has 67093 states and 97957 transitions. Word has length 115 [2024-10-12 21:39:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:57,177 INFO L471 AbstractCegarLoop]: Abstraction has 67093 states and 97957 transitions. [2024-10-12 21:39:57,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-12 21:39:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67093 states and 97957 transitions. [2024-10-12 21:39:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:57,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:57,185 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:57,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:39:57,185 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:57,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1375779856, now seen corresponding path program 1 times [2024-10-12 21:39:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:57,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030033656] [2024-10-12 21:39:57,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:39:57,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:57,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030033656] [2024-10-12 21:39:57,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030033656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:57,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:57,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:57,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072647793] [2024-10-12 21:39:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:57,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:57,676 INFO L87 Difference]: Start difference. First operand 67093 states and 97957 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-12 21:40:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:03,518 INFO L93 Difference]: Finished difference Result 332583 states and 485934 transitions. [2024-10-12 21:40:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:40:03,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 115 [2024-10-12 21:40:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:04,067 INFO L225 Difference]: With dead ends: 332583 [2024-10-12 21:40:04,068 INFO L226 Difference]: Without dead ends: 300197 [2024-10-12 21:40:04,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:40:04,154 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 11856 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11856 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:04,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11856 Valid, 4769 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300197 states. [2024-10-12 21:40:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300197 to 115733. [2024-10-12 21:40:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115733 states, 115731 states have (on average 1.4525148836526083) internal successors, (168101), 115732 states have internal predecessors, (168101), 0 states have call successors, (0), 0 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-12 21:40:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115733 states to 115733 states and 168101 transitions. [2024-10-12 21:40:09,327 INFO L78 Accepts]: Start accepts. Automaton has 115733 states and 168101 transitions. Word has length 115 [2024-10-12 21:40:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:09,328 INFO L471 AbstractCegarLoop]: Abstraction has 115733 states and 168101 transitions. [2024-10-12 21:40:09,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-12 21:40:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 115733 states and 168101 transitions. [2024-10-12 21:40:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:40:09,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:09,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:09,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:40:09,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2054749712, now seen corresponding path program 1 times [2024-10-12 21:40:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394649058] [2024-10-12 21:40:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 21:40:09,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:09,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394649058] [2024-10-12 21:40:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394649058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:09,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:40:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766773266] [2024-10-12 21:40:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:09,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:40:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:40:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:40:09,668 INFO L87 Difference]: Start difference. First operand 115733 states and 168101 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:40:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:16,992 INFO L93 Difference]: Finished difference Result 364967 states and 532910 transitions. [2024-10-12 21:40:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:40:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-12 21:40:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:17,604 INFO L225 Difference]: With dead ends: 364967 [2024-10-12 21:40:17,604 INFO L226 Difference]: Without dead ends: 332581 [2024-10-12 21:40:17,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:40:17,703 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11923 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11923 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:17,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11923 Valid, 4797 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332581 states. [2024-10-12 21:40:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332581 to 148117. [2024-10-12 21:40:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148117 states, 148115 states have (on average 1.4520946561793202) internal successors, (215077), 148116 states have internal predecessors, (215077), 0 states have call successors, (0), 0 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-12 21:40:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148117 states to 148117 states and 215077 transitions. [2024-10-12 21:40:23,919 INFO L78 Accepts]: Start accepts. Automaton has 148117 states and 215077 transitions. Word has length 115 [2024-10-12 21:40:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:23,920 INFO L471 AbstractCegarLoop]: Abstraction has 148117 states and 215077 transitions. [2024-10-12 21:40:23,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:40:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 148117 states and 215077 transitions. [2024-10-12 21:40:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:40:23,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:23,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:23,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:40:23,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2014805776, now seen corresponding path program 1 times [2024-10-12 21:40:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857496630] [2024-10-12 21:40:23,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat