./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.1.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label01.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46eee0da026a91c653f67365567ceb713876734d6acca1e922dede9c0b7a4734 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:57:15,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:57:15,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:57:15,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:57:15,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:57:15,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:57:15,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:57:15,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:57:15,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:57:15,535 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:57:15,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:57:15,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:57:15,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:57:15,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:57:15,537 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:57:15,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:57:15,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:57:15,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:57:15,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:57:15,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:57:15,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:57:15,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:57:15,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:57:15,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:57:15,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:57:15,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:57:15,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:57:15,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:57:15,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:57:15,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:57:15,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:57:15,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:57:15,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:57:15,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:57:15,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:57:15,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:57:15,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:57:15,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:57:15,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:57:15,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:57:15,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:57:15,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:57:15,549 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46eee0da026a91c653f67365567ceb713876734d6acca1e922dede9c0b7a4734 [2024-10-11 04:57:15,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:57:15,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:57:15,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:57:15,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:57:15,792 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:57:15,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:57:17,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:57:17,474 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:57:17,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:57:17,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c90b41c42/16a0514e245046cc86cc5f69fce8afa7/FLAG3d37f4cb9 [2024-10-11 04:57:17,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c90b41c42/16a0514e245046cc86cc5f69fce8afa7 [2024-10-11 04:57:17,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:57:17,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:57:17,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:57:17,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:57:17,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:57:17,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:57:17" (1/1) ... [2024-10-11 04:57:17,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137d2e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:17, skipping insertion in model container [2024-10-11 04:57:17,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:57:17" (1/1) ... [2024-10-11 04:57:17,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:57:18,003 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[26925,26938] [2024-10-11 04:57:18,047 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[32480,32493] [2024-10-11 04:57:18,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:57:18,587 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:57:18,622 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[26925,26938] [2024-10-11 04:57:18,632 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[32480,32493] [2024-10-11 04:57:19,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:57:19,053 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:57:19,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19 WrapperNode [2024-10-11 04:57:19,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:57:19,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:57:19,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:57:19,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:57:19,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,395 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5292 [2024-10-11 04:57:19,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:57:19,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:57:19,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:57:19,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:57:19,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,583 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:57:19,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:57:19,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:57:19,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:57:19,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:57:19,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (1/1) ... [2024-10-11 04:57:19,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:57:19,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:57:19,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:57:19,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:57:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:57:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:57:19,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:57:19,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:57:20,045 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:57:20,047 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:57:23,773 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-11 04:57:23,773 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:57:23,842 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:57:23,842 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:57:23,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:57:23 BoogieIcfgContainer [2024-10-11 04:57:23,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:57:23,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:57:23,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:57:23,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:57:23,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:57:17" (1/3) ... [2024-10-11 04:57:23,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1455064e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:57:23, skipping insertion in model container [2024-10-11 04:57:23,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:19" (2/3) ... [2024-10-11 04:57:23,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1455064e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:57:23, skipping insertion in model container [2024-10-11 04:57:23,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:57:23" (3/3) ... [2024-10-11 04:57:23,855 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:57:23,869 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:57:23,870 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:57:23,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:57:23,950 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;@30483667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:57:23,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:57:23,958 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-11 04:57:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:57:23,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:23,966 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-11 04:57:23,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:23,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:23,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1384355979, now seen corresponding path program 1 times [2024-10-11 04:57:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:23,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222224654] [2024-10-11 04:57:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:24,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222224654] [2024-10-11 04:57:24,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222224654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:24,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:57:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967666897] [2024-10-11 04:57:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:24,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:57:24,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:57:24,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:57:24,322 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-11 04:57:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:24,424 INFO L93 Difference]: Finished difference Result 1702 states and 3341 transitions. [2024-10-11 04:57:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:57:24,427 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-11 04:57:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:24,446 INFO L225 Difference]: With dead ends: 1702 [2024-10-11 04:57:24,446 INFO L226 Difference]: Without dead ends: 880 [2024-10-11 04:57:24,454 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-11 04:57:24,459 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-11 04:57:24,461 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-11 04:57:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-11 04:57:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-11 04:57:24,528 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-11 04:57:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2024-10-11 04:57:24,532 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 27 [2024-10-11 04:57:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:24,532 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2024-10-11 04:57:24,533 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-11 04:57:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2024-10-11 04:57:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:57:24,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:24,534 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-11 04:57:24,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:57:24,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:24,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:24,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1105172983, now seen corresponding path program 1 times [2024-10-11 04:57:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:24,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310422074] [2024-10-11 04:57:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:24,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:24,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:24,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310422074] [2024-10-11 04:57:24,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310422074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:24,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:57:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502389729] [2024-10-11 04:57:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:24,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:57:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:57:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:24,730 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-11 04:57:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:24,826 INFO L93 Difference]: Finished difference Result 944 states and 1766 transitions. [2024-10-11 04:57:24,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:57:24,827 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-11 04:57:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:24,830 INFO L225 Difference]: With dead ends: 944 [2024-10-11 04:57:24,831 INFO L226 Difference]: Without dead ends: 880 [2024-10-11 04:57:24,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:24,832 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-11 04:57:24,833 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-11 04:57:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-11 04:57:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-11 04:57:24,849 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-11 04:57:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1603 transitions. [2024-10-11 04:57:24,852 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1603 transitions. Word has length 27 [2024-10-11 04:57:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:24,852 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1603 transitions. [2024-10-11 04:57:24,853 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-11 04:57:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1603 transitions. [2024-10-11 04:57:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 04:57:24,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:24,854 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] [2024-10-11 04:57:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:57:24,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1758120397, now seen corresponding path program 1 times [2024-10-11 04:57:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:24,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048032588] [2024-10-11 04:57:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048032588] [2024-10-11 04:57:24,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048032588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:57:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264194524] [2024-10-11 04:57:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:24,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:24,971 INFO L87 Difference]: Start difference. First operand 880 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:27,726 INFO L93 Difference]: Finished difference Result 2384 states and 4476 transitions. [2024-10-11 04:57:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-11 04:57:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:27,733 INFO L225 Difference]: With dead ends: 2384 [2024-10-11 04:57:27,733 INFO L226 Difference]: Without dead ends: 1631 [2024-10-11 04:57:27,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:27,736 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 935 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:27,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 589 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:57:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-11 04:57:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-11 04:57:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.614487415592388) internal successors, (2630), 1630 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2630 transitions. [2024-10-11 04:57:27,773 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2630 transitions. Word has length 47 [2024-10-11 04:57:27,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:27,773 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2630 transitions. [2024-10-11 04:57:27,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2630 transitions. [2024-10-11 04:57:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:57:27,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:27,776 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-11 04:57:27,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:57:27,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:27,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash 131157287, now seen corresponding path program 1 times [2024-10-11 04:57:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430249601] [2024-10-11 04:57:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:28,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430249601] [2024-10-11 04:57:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430249601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:28,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986594718] [2024-10-11 04:57:28,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:28,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:28,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:28,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:28,103 INFO L87 Difference]: Start difference. First operand 1631 states and 2630 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-11 04:57:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:28,588 INFO L93 Difference]: Finished difference Result 2607 states and 4214 transitions. [2024-10-11 04:57:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 04:57:28,589 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-11 04:57:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:28,597 INFO L225 Difference]: With dead ends: 2607 [2024-10-11 04:57:28,597 INFO L226 Difference]: Without dead ends: 2546 [2024-10-11 04:57:28,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:57:28,602 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-11 04:57:28,602 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-11 04:57:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-11 04:57:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1690. [2024-10-11 04:57:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.6149289099526067) internal successors, (2726), 1689 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2726 transitions. [2024-10-11 04:57:28,636 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2726 transitions. Word has length 87 [2024-10-11 04:57:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:28,637 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2726 transitions. [2024-10-11 04:57:28,637 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-11 04:57:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2726 transitions. [2024-10-11 04:57:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:57:28,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:28,639 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-11 04:57:28,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:57:28,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1346972695, now seen corresponding path program 1 times [2024-10-11 04:57:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657838518] [2024-10-11 04:57:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657838518] [2024-10-11 04:57:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657838518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:28,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200545009] [2024-10-11 04:57:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:28,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:28,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:28,787 INFO L87 Difference]: Start difference. First operand 1690 states and 2726 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:28,836 INFO L93 Difference]: Finished difference Result 1919 states and 3097 transitions. [2024-10-11 04:57:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 04:57:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:28,844 INFO L225 Difference]: With dead ends: 1919 [2024-10-11 04:57:28,845 INFO L226 Difference]: Without dead ends: 1799 [2024-10-11 04:57:28,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:28,846 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-11 04:57:28,848 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-11 04:57:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-11 04:57:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1795. [2024-10-11 04:57:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6140546569994423) internal successors, (2894), 1794 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2894 transitions. [2024-10-11 04:57:28,881 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2894 transitions. Word has length 89 [2024-10-11 04:57:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2894 transitions. [2024-10-11 04:57:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2894 transitions. [2024-10-11 04:57:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:57:28,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:28,883 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-11 04:57:28,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:57:28,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:28,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1349117647, now seen corresponding path program 1 times [2024-10-11 04:57:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337123041] [2024-10-11 04:57:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:29,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:29,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337123041] [2024-10-11 04:57:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337123041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112773180] [2024-10-11 04:57:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:29,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:29,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:29,317 INFO L87 Difference]: Start difference. First operand 1795 states and 2894 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-11 04:57:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:29,809 INFO L93 Difference]: Finished difference Result 2022 states and 3258 transitions. [2024-10-11 04:57:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:29,810 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-11 04:57:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:29,817 INFO L225 Difference]: With dead ends: 2022 [2024-10-11 04:57:29,818 INFO L226 Difference]: Without dead ends: 1797 [2024-10-11 04:57:29,819 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-11 04:57:29,819 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 6112 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6112 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:29,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6112 Valid, 2258 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-10-11 04:57:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2024-10-11 04:57:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6129392080312326) internal successors, (2892), 1794 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2892 transitions. [2024-10-11 04:57:29,867 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2892 transitions. Word has length 89 [2024-10-11 04:57:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:29,867 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2892 transitions. [2024-10-11 04:57:29,868 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-11 04:57:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2892 transitions. [2024-10-11 04:57:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 04:57:29,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:29,869 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-11 04:57:29,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:57:29,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:29,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1255956927, now seen corresponding path program 1 times [2024-10-11 04:57:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:29,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306475664] [2024-10-11 04:57:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306475664] [2024-10-11 04:57:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306475664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:57:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564217334] [2024-10-11 04:57:30,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:30,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:57:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:57:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:30,094 INFO L87 Difference]: Start difference. First operand 1795 states and 2892 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-11 04:57:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:30,138 INFO L93 Difference]: Finished difference Result 1801 states and 2899 transitions. [2024-10-11 04:57:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:57:30,138 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-11 04:57:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:30,146 INFO L225 Difference]: With dead ends: 1801 [2024-10-11 04:57:30,146 INFO L226 Difference]: Without dead ends: 1799 [2024-10-11 04:57:30,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:30,149 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-11 04:57:30,150 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-11 04:57:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-11 04:57:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2024-10-11 04:57:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.6110183639398998) internal successors, (2895), 1798 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2895 transitions. [2024-10-11 04:57:30,194 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2895 transitions. Word has length 90 [2024-10-11 04:57:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2895 transitions. [2024-10-11 04:57:30,195 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-11 04:57:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2895 transitions. [2024-10-11 04:57:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:30,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:30,196 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-11 04:57:30,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:57:30,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1698293969, now seen corresponding path program 1 times [2024-10-11 04:57:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:30,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233893943] [2024-10-11 04:57:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:30,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233893943] [2024-10-11 04:57:30,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233893943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:30,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:30,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887316541] [2024-10-11 04:57:30,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:30,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:30,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:30,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,285 INFO L87 Difference]: Start difference. First operand 1799 states and 2895 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:30,332 INFO L93 Difference]: Finished difference Result 2241 states and 3595 transitions. [2024-10-11 04:57:30,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:30,338 INFO L225 Difference]: With dead ends: 2241 [2024-10-11 04:57:30,339 INFO L226 Difference]: Without dead ends: 2012 [2024-10-11 04:57:30,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,340 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-11 04:57:30,341 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-11 04:57:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2024-10-11 04:57:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2010. [2024-10-11 04:57:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2008 states have (on average 1.6065737051792828) internal successors, (3226), 2009 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3226 transitions. [2024-10-11 04:57:30,384 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3226 transitions. Word has length 91 [2024-10-11 04:57:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:30,384 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 3226 transitions. [2024-10-11 04:57:30,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3226 transitions. [2024-10-11 04:57:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:30,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:30,386 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-11 04:57:30,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:57:30,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:30,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash -942909905, now seen corresponding path program 1 times [2024-10-11 04:57:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694582832] [2024-10-11 04:57:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694582832] [2024-10-11 04:57:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694582832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265035097] [2024-10-11 04:57:30,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:30,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,478 INFO L87 Difference]: Start difference. First operand 2010 states and 3226 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:30,518 INFO L93 Difference]: Finished difference Result 2858 states and 4560 transitions. [2024-10-11 04:57:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:30,526 INFO L225 Difference]: With dead ends: 2858 [2024-10-11 04:57:30,527 INFO L226 Difference]: Without dead ends: 2418 [2024-10-11 04:57:30,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,529 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-11 04:57:30,530 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-11 04:57:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2024-10-11 04:57:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2416. [2024-10-11 04:57:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2414 states have (on average 1.5973487986743993) internal successors, (3856), 2415 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3856 transitions. [2024-10-11 04:57:30,575 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3856 transitions. Word has length 91 [2024-10-11 04:57:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:30,576 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3856 transitions. [2024-10-11 04:57:30,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3856 transitions. [2024-10-11 04:57:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:30,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:30,577 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-11 04:57:30,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:57:30,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:30,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1621879761, now seen corresponding path program 1 times [2024-10-11 04:57:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:30,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136843950] [2024-10-11 04:57:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136843950] [2024-10-11 04:57:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136843950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:30,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:30,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291905899] [2024-10-11 04:57:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:30,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:30,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,649 INFO L87 Difference]: Start difference. First operand 2416 states and 3856 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:30,693 INFO L93 Difference]: Finished difference Result 4044 states and 6394 transitions. [2024-10-11 04:57:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:30,703 INFO L225 Difference]: With dead ends: 4044 [2024-10-11 04:57:30,704 INFO L226 Difference]: Without dead ends: 3198 [2024-10-11 04:57:30,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,707 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-11 04:57:30,707 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-11 04:57:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2024-10-11 04:57:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3196. [2024-10-11 04:57:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3194 states have (on average 1.5817157169693175) internal successors, (5052), 3195 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 5052 transitions. [2024-10-11 04:57:30,770 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 5052 transitions. Word has length 91 [2024-10-11 04:57:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:30,771 INFO L471 AbstractCegarLoop]: Abstraction has 3196 states and 5052 transitions. [2024-10-11 04:57:30,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 5052 transitions. [2024-10-11 04:57:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:30,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:30,772 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-11 04:57:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:57:30,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1581935825, now seen corresponding path program 1 times [2024-10-11 04:57:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959980662] [2024-10-11 04:57:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:30,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959980662] [2024-10-11 04:57:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959980662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:30,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:30,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83644814] [2024-10-11 04:57:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:30,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:30,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,850 INFO L87 Difference]: Start difference. First operand 3196 states and 5052 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:30,945 INFO L93 Difference]: Finished difference Result 6320 states and 9870 transitions. [2024-10-11 04:57:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:30,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:30,963 INFO L225 Difference]: With dead ends: 6320 [2024-10-11 04:57:30,963 INFO L226 Difference]: Without dead ends: 4694 [2024-10-11 04:57:30,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:30,967 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-11 04:57:30,967 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-11 04:57:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2024-10-11 04:57:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4692. [2024-10-11 04:57:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 4690 states have (on average 1.5599147121535182) internal successors, (7316), 4691 states have internal predecessors, (7316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 7316 transitions. [2024-10-11 04:57:31,069 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 7316 transitions. Word has length 91 [2024-10-11 04:57:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:31,070 INFO L471 AbstractCegarLoop]: Abstraction has 4692 states and 7316 transitions. [2024-10-11 04:57:31,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 7316 transitions. [2024-10-11 04:57:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:31,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:31,072 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-11 04:57:31,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:57:31,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1318858449, now seen corresponding path program 1 times [2024-10-11 04:57:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902577483] [2024-10-11 04:57:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:31,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902577483] [2024-10-11 04:57:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902577483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:31,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801211173] [2024-10-11 04:57:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:31,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:31,141 INFO L87 Difference]: Start difference. First operand 4692 states and 7316 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:31,259 INFO L93 Difference]: Finished difference Result 10680 states and 16438 transitions. [2024-10-11 04:57:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:31,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:31,278 INFO L225 Difference]: With dead ends: 10680 [2024-10-11 04:57:31,278 INFO L226 Difference]: Without dead ends: 7558 [2024-10-11 04:57:31,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:31,285 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-11 04:57:31,285 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-11 04:57:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2024-10-11 04:57:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7556. [2024-10-11 04:57:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7556 states, 7554 states have (on average 1.5340217103521314) internal successors, (11588), 7555 states have internal predecessors, (11588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7556 states to 7556 states and 11588 transitions. [2024-10-11 04:57:31,451 INFO L78 Accepts]: Start accepts. Automaton has 7556 states and 11588 transitions. Word has length 91 [2024-10-11 04:57:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:31,451 INFO L471 AbstractCegarLoop]: Abstraction has 7556 states and 11588 transitions. [2024-10-11 04:57:31,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7556 states and 11588 transitions. [2024-10-11 04:57:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:31,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:31,453 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-11 04:57:31,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:57:31,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:31,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2087375407, now seen corresponding path program 1 times [2024-10-11 04:57:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:31,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786577377] [2024-10-11 04:57:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786577377] [2024-10-11 04:57:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786577377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:31,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:31,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813264709] [2024-10-11 04:57:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:31,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:31,533 INFO L87 Difference]: Start difference. First operand 7556 states and 11588 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:31,729 INFO L93 Difference]: Finished difference Result 19016 states and 28806 transitions. [2024-10-11 04:57:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:31,757 INFO L225 Difference]: With dead ends: 19016 [2024-10-11 04:57:31,757 INFO L226 Difference]: Without dead ends: 13030 [2024-10-11 04:57:31,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:31,769 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-11 04:57:31,770 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-11 04:57:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13030 states. [2024-10-11 04:57:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13030 to 13028. [2024-10-11 04:57:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13028 states, 13026 states have (on average 1.506218332565638) internal successors, (19620), 13027 states have internal predecessors, (19620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 19620 transitions. [2024-10-11 04:57:32,112 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 19620 transitions. Word has length 91 [2024-10-11 04:57:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:32,113 INFO L471 AbstractCegarLoop]: Abstraction has 13028 states and 19620 transitions. [2024-10-11 04:57:32,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 19620 transitions. [2024-10-11 04:57:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:32,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:32,114 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-11 04:57:32,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:57:32,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:32,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1353296593, now seen corresponding path program 1 times [2024-10-11 04:57:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:32,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328663814] [2024-10-11 04:57:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:32,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:32,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328663814] [2024-10-11 04:57:32,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328663814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:32,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:32,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:32,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500445665] [2024-10-11 04:57:32,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:32,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:32,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:32,177 INFO L87 Difference]: Start difference. First operand 13028 states and 19620 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:32,505 INFO L93 Difference]: Finished difference Result 34920 states and 52006 transitions. [2024-10-11 04:57:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:32,546 INFO L225 Difference]: With dead ends: 34920 [2024-10-11 04:57:32,546 INFO L226 Difference]: Without dead ends: 23462 [2024-10-11 04:57:32,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:32,565 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-11 04:57:32,566 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-11 04:57:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23462 states. [2024-10-11 04:57:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23462 to 23460. [2024-10-11 04:57:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23460 states, 23458 states have (on average 1.477534316651036) internal successors, (34660), 23459 states have internal predecessors, (34660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23460 states to 23460 states and 34660 transitions. [2024-10-11 04:57:33,194 INFO L78 Accepts]: Start accepts. Automaton has 23460 states and 34660 transitions. Word has length 91 [2024-10-11 04:57:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:33,194 INFO L471 AbstractCegarLoop]: Abstraction has 23460 states and 34660 transitions. [2024-10-11 04:57:33,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 23460 states and 34660 transitions. [2024-10-11 04:57:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:57:33,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:33,196 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-11 04:57:33,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:57:33,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:33,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1258857876, now seen corresponding path program 1 times [2024-10-11 04:57:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696739086] [2024-10-11 04:57:33,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696739086] [2024-10-11 04:57:33,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696739086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:33,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:33,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280451488] [2024-10-11 04:57:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:33,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:33,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:33,268 INFO L87 Difference]: Start difference. First operand 23460 states and 34660 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:33,898 INFO L93 Difference]: Finished difference Result 45995 states and 68202 transitions. [2024-10-11 04:57:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:33,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 04:57:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:33,965 INFO L225 Difference]: With dead ends: 45995 [2024-10-11 04:57:33,965 INFO L226 Difference]: Without dead ends: 33960 [2024-10-11 04:57:33,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:33,986 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-11 04:57:33,986 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-11 04:57:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33960 states. [2024-10-11 04:57:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33960 to 33958. [2024-10-11 04:57:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33958 states, 33956 states have (on average 1.4693721286370598) internal successors, (49894), 33957 states have internal predecessors, (49894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33958 states to 33958 states and 49894 transitions. [2024-10-11 04:57:35,022 INFO L78 Accepts]: Start accepts. Automaton has 33958 states and 49894 transitions. Word has length 93 [2024-10-11 04:57:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:35,022 INFO L471 AbstractCegarLoop]: Abstraction has 33958 states and 49894 transitions. [2024-10-11 04:57:35,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33958 states and 49894 transitions. [2024-10-11 04:57:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:57:35,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:35,029 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-11 04:57:35,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:57:35,029 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:35,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1139897777, now seen corresponding path program 1 times [2024-10-11 04:57:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:35,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963441578] [2024-10-11 04:57:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:35,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:35,354 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-11 04:57:35,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963441578] [2024-10-11 04:57:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963441578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:35,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178343257] [2024-10-11 04:57:35,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:35,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:35,356 INFO L87 Difference]: Start difference. First operand 33958 states and 49894 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-11 04:57:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:39,555 INFO L93 Difference]: Finished difference Result 299448 states and 437871 transitions. [2024-10-11 04:57:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:39,556 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-11 04:57:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:40,350 INFO L225 Difference]: With dead ends: 299448 [2024-10-11 04:57:40,350 INFO L226 Difference]: Without dead ends: 267062 [2024-10-11 04:57:40,419 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-11 04:57:40,420 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 11808 mSDsluCounter, 3264 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11808 SdHoareTripleChecker+Valid, 4962 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:40,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11808 Valid, 4962 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:57:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267062 states. [2024-10-11 04:57:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267062 to 66342. [2024-10-11 04:57:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66342 states, 66340 states have (on average 1.4602050045221586) internal successors, (96870), 66341 states have internal predecessors, (96870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66342 states to 66342 states and 96870 transitions. [2024-10-11 04:57:44,325 INFO L78 Accepts]: Start accepts. Automaton has 66342 states and 96870 transitions. Word has length 115 [2024-10-11 04:57:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:44,325 INFO L471 AbstractCegarLoop]: Abstraction has 66342 states and 96870 transitions. [2024-10-11 04:57:44,326 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-11 04:57:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 66342 states and 96870 transitions. [2024-10-11 04:57:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:57:44,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:44,334 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-11 04:57:44,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:57:44,334 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:44,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1895281841, now seen corresponding path program 1 times [2024-10-11 04:57:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:44,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6483445] [2024-10-11 04:57:44,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:44,774 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-11 04:57:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6483445] [2024-10-11 04:57:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6483445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:44,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129428086] [2024-10-11 04:57:44,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:44,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:44,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:44,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:44,776 INFO L87 Difference]: Start difference. First operand 66342 states and 96870 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-11 04:57:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:50,738 INFO L93 Difference]: Finished difference Result 331832 states and 484847 transitions. [2024-10-11 04:57:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:50,738 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-11 04:57:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:51,323 INFO L225 Difference]: With dead ends: 331832 [2024-10-11 04:57:51,323 INFO L226 Difference]: Without dead ends: 299446 [2024-10-11 04:57:51,413 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-11 04:57:51,414 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:51,414 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.1s Time] [2024-10-11 04:57:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299446 states. [2024-10-11 04:57:56,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299446 to 114982. [2024-10-11 04:57:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114982 states, 114980 states have (on average 1.4525482692642198) internal successors, (167014), 114981 states have internal predecessors, (167014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114982 states to 114982 states and 167014 transitions. [2024-10-11 04:57:56,804 INFO L78 Accepts]: Start accepts. Automaton has 114982 states and 167014 transitions. Word has length 115 [2024-10-11 04:57:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:56,804 INFO L471 AbstractCegarLoop]: Abstraction has 114982 states and 167014 transitions. [2024-10-11 04:57:56,804 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-11 04:57:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 114982 states and 167014 transitions. [2024-10-11 04:57:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:57:56,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:56,813 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-11 04:57:56,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:57:56,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:56,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1216311985, now seen corresponding path program 1 times [2024-10-11 04:57:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677930734] [2024-10-11 04:57:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:57,303 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-11 04:57:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677930734] [2024-10-11 04:57:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677930734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851662154] [2024-10-11 04:57:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:57,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:57,305 INFO L87 Difference]: Start difference. First operand 114982 states and 167014 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-11 04:58:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:58:04,310 INFO L93 Difference]: Finished difference Result 364216 states and 531823 transitions. [2024-10-11 04:58:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:58:04,311 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-11 04:58:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:58:05,152 INFO L225 Difference]: With dead ends: 364216 [2024-10-11 04:58:05,152 INFO L226 Difference]: Without dead ends: 331830 [2024-10-11 04:58:05,217 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-11 04:58:05,217 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11927 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11927 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:58:05,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11927 Valid, 4767 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:58:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331830 states.