./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.3.ufo.UNBOUNDED.pals+Problem12_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:42:16,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:42:16,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:42:16,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:42:16,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:42:16,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:42:16,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:42:16,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:42:16,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:42:16,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:42:16,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:42:16,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:42:16,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:42:16,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:42:16,658 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:42:16,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:42:16,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:42:16,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:42:16,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:42:16,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:42:16,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:42:16,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:42:16,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:42:16,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:42:16,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:42:16,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:42:16,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:42:16,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:42:16,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:42:16,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:42:16,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:42:16,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:42:16,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:42:16,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:42:16,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:42:16,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:42:16,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:42:16,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:42:16,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:42:16,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:42:16,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:42:16,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:42:16,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e [2024-10-24 02:42:16,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:42:16,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:42:16,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:42:16,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:42:16,956 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:42:16,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-24 02:42:18,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:42:18,779 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:42:18,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-24 02:42:18,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea3a21a8/522597d76c2b4dd0b6ab2d2c5e74f98f/FLAG21f4b3151 [2024-10-24 02:42:18,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea3a21a8/522597d76c2b4dd0b6ab2d2c5e74f98f [2024-10-24 02:42:18,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:42:18,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:42:18,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:42:18,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:42:18,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:42:18,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:42:18" (1/1) ... [2024-10-24 02:42:18,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edc7cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:18, skipping insertion in model container [2024-10-24 02:42:18,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:42:18" (1/1) ... [2024-10-24 02:42:18,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:42:19,350 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[6450,6463] [2024-10-24 02:42:19,398 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[9957,9970] [2024-10-24 02:42:20,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:42:20,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:42:20,082 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[6450,6463] [2024-10-24 02:42:20,092 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[9957,9970] [2024-10-24 02:42:20,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:42:20,526 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:42:20,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20 WrapperNode [2024-10-24 02:42:20,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:42:20,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:42:20,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:42:20,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:42:20,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:20,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:20,877 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4983 [2024-10-24 02:42:20,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:42:20,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:42:20,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:42:20,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:42:20,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:20,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,132 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-24 02:42:21,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:42:21,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:42:21,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:42:21,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:42:21,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (1/1) ... [2024-10-24 02:42:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:42:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:21,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:42:21,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:42:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:42:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:42:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:42:21,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:42:21,662 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:42:21,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:42:26,401 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-10-24 02:42:26,402 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:42:26,486 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:42:26,486 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 02:42:26,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:42:26 BoogieIcfgContainer [2024-10-24 02:42:26,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:42:26,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:42:26,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:42:26,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:42:26,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:42:18" (1/3) ... [2024-10-24 02:42:26,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dcf4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:42:26, skipping insertion in model container [2024-10-24 02:42:26,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:20" (2/3) ... [2024-10-24 02:42:26,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dcf4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:42:26, skipping insertion in model container [2024-10-24 02:42:26,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:42:26" (3/3) ... [2024-10-24 02:42:26,497 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-24 02:42:26,514 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:42:26,514 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:42:26,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:42:26,621 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;@5ca5e14c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:42:26,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:42:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 0 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-24 02:42:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 02:42:26,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:26,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:26,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2106044916, now seen corresponding path program 1 times [2024-10-24 02:42:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717500045] [2024-10-24 02:42:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:26,863 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-24 02:42:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717500045] [2024-10-24 02:42:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717500045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:26,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:26,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 02:42:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170936214] [2024-10-24 02:42:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 02:42:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 02:42:26,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 02:42:26,901 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-24 02:42:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:27,013 INFO L93 Difference]: Finished difference Result 1597 states and 3151 transitions. [2024-10-24 02:42:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 02:42:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-24 02:42:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:27,036 INFO L225 Difference]: With dead ends: 1597 [2024-10-24 02:42:27,036 INFO L226 Difference]: Without dead ends: 805 [2024-10-24 02:42:27,041 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-24 02:42:27,045 INFO L432 NwaCegarLoop]: 1523 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, 1523 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-24 02:42:27,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-24 02:42:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-24 02:42:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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-24 02:42:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2024-10-24 02:42:27,139 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2024-10-24 02:42:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:27,139 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2024-10-24 02:42:27,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-24 02:42:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2024-10-24 02:42:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 02:42:27,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:27,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:27,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:42:27,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:27,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1602116366, now seen corresponding path program 1 times [2024-10-24 02:42:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542291170] [2024-10-24 02:42:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:27,326 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-24 02:42:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542291170] [2024-10-24 02:42:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542291170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:27,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:42:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243435420] [2024-10-24 02:42:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:42:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:27,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:42:27,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:42:27,334 INFO L87 Difference]: Start difference. First operand 805 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-24 02:42:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:27,441 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2024-10-24 02:42:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:42:27,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-24 02:42:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:27,445 INFO L225 Difference]: With dead ends: 839 [2024-10-24 02:42:27,445 INFO L226 Difference]: Without dead ends: 805 [2024-10-24 02:42:27,446 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-24 02:42:27,447 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:27,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4543 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:42:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-24 02:42:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-24 02:42:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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-24 02:42:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2024-10-24 02:42:27,473 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2024-10-24 02:42:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:27,474 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2024-10-24 02:42:27,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-24 02:42:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2024-10-24 02:42:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 02:42:27,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:27,477 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] [2024-10-24 02:42:27,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:42:27,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:27,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1997221712, now seen corresponding path program 1 times [2024-10-24 02:42:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352355641] [2024-10-24 02:42:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:27,570 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-24 02:42:27,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352355641] [2024-10-24 02:42:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352355641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 02:42:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121761284] [2024-10-24 02:42:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:27,573 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-24 02:42:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:30,968 INFO L93 Difference]: Finished difference Result 2309 states and 4381 transitions. [2024-10-24 02:42:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:30,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-24 02:42:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:30,976 INFO L225 Difference]: With dead ends: 2309 [2024-10-24 02:42:30,976 INFO L226 Difference]: Without dead ends: 1556 [2024-10-24 02:42:30,978 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-24 02:42:30,979 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 841 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:30,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 541 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 02:42:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-10-24 02:42:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-10-24 02:42:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1554 states have (on average 1.6003861003861004) internal successors, (2487), 1555 states have internal predecessors, (2487), 0 states have call successors, (0), 0 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-24 02:42:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2487 transitions. [2024-10-24 02:42:31,013 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2487 transitions. Word has length 29 [2024-10-24 02:42:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:31,014 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2487 transitions. [2024-10-24 02:42:31,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-24 02:42:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2487 transitions. [2024-10-24 02:42:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 02:42:31,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:31,015 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] [2024-10-24 02:42:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:42:31,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:31,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1530210848, now seen corresponding path program 1 times [2024-10-24 02:42:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322482260] [2024-10-24 02:42:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:31,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:31,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322482260] [2024-10-24 02:42:31,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322482260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:31,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:31,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519868421] [2024-10-24 02:42:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:31,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:31,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:31,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:31,182 INFO L87 Difference]: Start difference. First operand 1556 states and 2487 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-24 02:42:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,294 INFO L93 Difference]: Finished difference Result 1742 states and 2781 transitions. [2024-10-24 02:42:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:42:31,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-24 02:42:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,302 INFO L225 Difference]: With dead ends: 1742 [2024-10-24 02:42:31,302 INFO L226 Difference]: Without dead ends: 1711 [2024-10-24 02:42:31,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:42:31,304 INFO L432 NwaCegarLoop]: 1499 mSDtfsCounter, 4669 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:31,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 1742 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:42:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-24 02:42:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1585. [2024-10-24 02:42:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.600126342387871) internal successors, (2533), 1584 states have internal predecessors, (2533), 0 states have call successors, (0), 0 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-24 02:42:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2533 transitions. [2024-10-24 02:42:31,335 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2533 transitions. Word has length 32 [2024-10-24 02:42:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:31,335 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2533 transitions. [2024-10-24 02:42:31,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-24 02:42:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2533 transitions. [2024-10-24 02:42:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 02:42:31,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:31,336 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] [2024-10-24 02:42:31,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:42:31,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:31,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:31,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1777422384, now seen corresponding path program 1 times [2024-10-24 02:42:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277641608] [2024-10-24 02:42:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:31,414 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-24 02:42:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277641608] [2024-10-24 02:42:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277641608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:31,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780366771] [2024-10-24 02:42:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:31,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:31,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:31,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:31,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:31,418 INFO L87 Difference]: Start difference. First operand 1585 states and 2533 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,463 INFO L93 Difference]: Finished difference Result 1694 states and 2704 transitions. [2024-10-24 02:42:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:31,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-24 02:42:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,470 INFO L225 Difference]: With dead ends: 1694 [2024-10-24 02:42:31,470 INFO L226 Difference]: Without dead ends: 1634 [2024-10-24 02:42:31,471 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-24 02:42:31,472 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 1466 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1542 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-24 02:42:31,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1542 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-24 02:42:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1630. [2024-10-24 02:42:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.5976658476658476) internal successors, (2601), 1629 states have internal predecessors, (2601), 0 states have call successors, (0), 0 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-24 02:42:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2601 transitions. [2024-10-24 02:42:31,507 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2601 transitions. Word has length 34 [2024-10-24 02:42:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:31,507 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2601 transitions. [2024-10-24 02:42:31,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2601 transitions. [2024-10-24 02:42:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 02:42:31,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:31,509 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] [2024-10-24 02:42:31,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:42:31,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1775277432, now seen corresponding path program 1 times [2024-10-24 02:42:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:31,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684737956] [2024-10-24 02:42:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:31,684 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-24 02:42:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684737956] [2024-10-24 02:42:31,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684737956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:31,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:31,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350318111] [2024-10-24 02:42:31,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:31,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:31,687 INFO L87 Difference]: Start difference. First operand 1630 states and 2601 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,770 INFO L93 Difference]: Finished difference Result 1737 states and 2765 transitions. [2024-10-24 02:42:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-24 02:42:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,777 INFO L225 Difference]: With dead ends: 1737 [2024-10-24 02:42:31,778 INFO L226 Difference]: Without dead ends: 1632 [2024-10-24 02:42:31,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:42:31,780 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 1476 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:31,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1632 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-10-24 02:42:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-10-24 02:42:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.5964373464373465) internal successors, (2599), 1629 states have internal predecessors, (2599), 0 states have call successors, (0), 0 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-24 02:42:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2599 transitions. [2024-10-24 02:42:31,811 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2599 transitions. Word has length 34 [2024-10-24 02:42:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:31,811 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2599 transitions. [2024-10-24 02:42:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2599 transitions. [2024-10-24 02:42:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 02:42:31,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:31,813 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] [2024-10-24 02:42:31,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 02:42:31,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:31,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash 672590802, now seen corresponding path program 1 times [2024-10-24 02:42:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174136800] [2024-10-24 02:42:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:31,939 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-24 02:42:31,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:31,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174136800] [2024-10-24 02:42:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174136800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:31,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:31,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:42:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070241252] [2024-10-24 02:42:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:42:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:42:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:42:31,942 INFO L87 Difference]: Start difference. First operand 1630 states and 2599 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,979 INFO L93 Difference]: Finished difference Result 1636 states and 2606 transitions. [2024-10-24 02:42:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:42:31,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-24 02:42:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,986 INFO L225 Difference]: With dead ends: 1636 [2024-10-24 02:42:31,986 INFO L226 Difference]: Without dead ends: 1634 [2024-10-24 02:42:31,987 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-24 02:42:31,989 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 0 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4504 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-24 02:42:31,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-24 02:42:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-10-24 02:42:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.5943627450980393) internal successors, (2602), 1633 states have internal predecessors, (2602), 0 states have call successors, (0), 0 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-24 02:42:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2602 transitions. [2024-10-24 02:42:32,022 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2602 transitions. Word has length 35 [2024-10-24 02:42:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,022 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2602 transitions. [2024-10-24 02:42:32,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2602 transitions. [2024-10-24 02:42:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 02:42:32,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,024 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] [2024-10-24 02:42:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 02:42:32,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1662873624, now seen corresponding path program 1 times [2024-10-24 02:42:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075412295] [2024-10-24 02:42:32,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:32,063 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-24 02:42:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075412295] [2024-10-24 02:42:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075412295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483150824] [2024-10-24 02:42:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:32,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:32,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:32,065 INFO L87 Difference]: Start difference. First operand 1634 states and 2602 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:32,094 INFO L93 Difference]: Finished difference Result 1836 states and 2902 transitions. [2024-10-24 02:42:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-24 02:42:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:32,102 INFO L225 Difference]: With dead ends: 1836 [2024-10-24 02:42:32,102 INFO L226 Difference]: Without dead ends: 1727 [2024-10-24 02:42:32,103 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-24 02:42:32,104 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 1473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1577 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-24 02:42:32,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1577 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-24 02:42:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1725. [2024-10-24 02:42:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1723 states have (on average 1.5861868833430064) internal successors, (2733), 1724 states have internal predecessors, (2733), 0 states have call successors, (0), 0 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-24 02:42:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2733 transitions. [2024-10-24 02:42:32,138 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2733 transitions. Word has length 36 [2024-10-24 02:42:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,138 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2733 transitions. [2024-10-24 02:42:32,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2733 transitions. [2024-10-24 02:42:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 02:42:32,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:42:32,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1743360232, now seen corresponding path program 1 times [2024-10-24 02:42:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761544822] [2024-10-24 02:42:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:32,188 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-24 02:42:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:32,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761544822] [2024-10-24 02:42:32,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761544822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:32,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:32,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919511249] [2024-10-24 02:42:32,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:32,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:32,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:32,190 INFO L87 Difference]: Start difference. First operand 1725 states and 2733 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:32,225 INFO L93 Difference]: Finished difference Result 2093 states and 3267 transitions. [2024-10-24 02:42:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:32,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-24 02:42:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:32,233 INFO L225 Difference]: With dead ends: 2093 [2024-10-24 02:42:32,233 INFO L226 Difference]: Without dead ends: 1893 [2024-10-24 02:42:32,234 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-24 02:42:32,236 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 1475 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1583 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-24 02:42:32,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1583 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-10-24 02:42:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1891. [2024-10-24 02:42:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.5685547908946533) internal successors, (2963), 1890 states have internal predecessors, (2963), 0 states have call successors, (0), 0 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-24 02:42:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2963 transitions. [2024-10-24 02:42:32,277 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2963 transitions. Word has length 36 [2024-10-24 02:42:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,278 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2963 transitions. [2024-10-24 02:42:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2963 transitions. [2024-10-24 02:42:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 02:42:32,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,279 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] [2024-10-24 02:42:32,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 02:42:32,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1790190323, now seen corresponding path program 1 times [2024-10-24 02:42:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216735673] [2024-10-24 02:42:32,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:32,326 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-24 02:42:32,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:32,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216735673] [2024-10-24 02:42:32,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216735673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:32,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:32,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:32,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322788887] [2024-10-24 02:42:32,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:32,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:32,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:32,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:32,328 INFO L87 Difference]: Start difference. First operand 1891 states and 2963 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:32,363 INFO L93 Difference]: Finished difference Result 2282 states and 3537 transitions. [2024-10-24 02:42:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-24 02:42:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:32,371 INFO L225 Difference]: With dead ends: 2282 [2024-10-24 02:42:32,372 INFO L226 Difference]: Without dead ends: 2063 [2024-10-24 02:42:32,373 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-24 02:42:32,374 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1474 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1584 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-24 02:42:32,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2024-10-24 02:42:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2061. [2024-10-24 02:42:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2059 states have (on average 1.554638173870811) internal successors, (3201), 2060 states have internal predecessors, (3201), 0 states have call successors, (0), 0 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-24 02:42:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3201 transitions. [2024-10-24 02:42:32,418 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3201 transitions. Word has length 38 [2024-10-24 02:42:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3201 transitions. [2024-10-24 02:42:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3201 transitions. [2024-10-24 02:42:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 02:42:32,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,420 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:32,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:42:32,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1801881872, now seen corresponding path program 1 times [2024-10-24 02:42:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799932441] [2024-10-24 02:42:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 02:42:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:32,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799932441] [2024-10-24 02:42:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799932441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505964355] [2024-10-24 02:42:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:32,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:32,582 INFO L87 Difference]: Start difference. First operand 2061 states and 3201 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-24 02:42:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:32,693 INFO L93 Difference]: Finished difference Result 3785 states and 5649 transitions. [2024-10-24 02:42:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:32,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2024-10-24 02:42:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:32,704 INFO L225 Difference]: With dead ends: 3785 [2024-10-24 02:42:32,705 INFO L226 Difference]: Without dead ends: 3251 [2024-10-24 02:42:32,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:42:32,707 INFO L432 NwaCegarLoop]: 1543 mSDtfsCounter, 3051 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:32,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:42:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2024-10-24 02:42:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2593. [2024-10-24 02:42:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2591 states have (on average 1.5241219606329603) internal successors, (3949), 2592 states have internal predecessors, (3949), 0 states have call successors, (0), 0 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-24 02:42:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3949 transitions. [2024-10-24 02:42:32,768 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3949 transitions. Word has length 50 [2024-10-24 02:42:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,768 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 3949 transitions. [2024-10-24 02:42:32,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-24 02:42:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3949 transitions. [2024-10-24 02:42:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 02:42:32,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:32,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 02:42:32,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 913148432, now seen corresponding path program 1 times [2024-10-24 02:42:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367007797] [2024-10-24 02:42:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 02:42:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:32,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367007797] [2024-10-24 02:42:32,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367007797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:32,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20862038] [2024-10-24 02:42:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:32,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:32,882 INFO L87 Difference]: Start difference. First operand 2593 states and 3949 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-24 02:42:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:32,988 INFO L93 Difference]: Finished difference Result 4317 states and 6397 transitions. [2024-10-24 02:42:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:32,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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 50 [2024-10-24 02:42:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:33,002 INFO L225 Difference]: With dead ends: 4317 [2024-10-24 02:42:33,002 INFO L226 Difference]: Without dead ends: 3783 [2024-10-24 02:42:33,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:42:33,005 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 3047 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:33,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3142 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2024-10-24 02:42:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3393. [2024-10-24 02:42:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3391 states have (on average 1.4924800943674432) internal successors, (5061), 3392 states have internal predecessors, (5061), 0 states have call successors, (0), 0 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-24 02:42:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 5061 transitions. [2024-10-24 02:42:33,079 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 5061 transitions. Word has length 50 [2024-10-24 02:42:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:33,080 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 5061 transitions. [2024-10-24 02:42:33,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-24 02:42:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 5061 transitions. [2024-10-24 02:42:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:42:33,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:33,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:33,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 02:42:33,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 615190968, now seen corresponding path program 1 times [2024-10-24 02:42:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350854338] [2024-10-24 02:42:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:33,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:33,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350854338] [2024-10-24 02:42:33,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350854338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460308170] [2024-10-24 02:42:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:33,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:33,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:33,178 INFO L87 Difference]: Start difference. First operand 3393 states and 5061 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-24 02:42:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:33,228 INFO L93 Difference]: Finished difference Result 4756 states and 7011 transitions. [2024-10-24 02:42:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:33,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-24 02:42:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:33,244 INFO L225 Difference]: With dead ends: 4756 [2024-10-24 02:42:33,245 INFO L226 Difference]: Without dead ends: 2890 [2024-10-24 02:42:33,247 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-24 02:42:33,248 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 34 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:33,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3020 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2024-10-24 02:42:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2024-10-24 02:42:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2886 states have (on average 1.5107415107415108) internal successors, (4360), 2887 states have internal predecessors, (4360), 0 states have call successors, (0), 0 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-24 02:42:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4360 transitions. [2024-10-24 02:42:33,311 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4360 transitions. Word has length 52 [2024-10-24 02:42:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:33,311 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4360 transitions. [2024-10-24 02:42:33,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-24 02:42:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4360 transitions. [2024-10-24 02:42:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:42:33,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:33,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:33,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 02:42:33,313 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash -759813067, now seen corresponding path program 1 times [2024-10-24 02:42:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399737281] [2024-10-24 02:42:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:42:33,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399737281] [2024-10-24 02:42:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399737281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:33,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679433195] [2024-10-24 02:42:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:33,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:33,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:33,397 INFO L87 Difference]: Start difference. First operand 2888 states and 4360 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:33,494 INFO L93 Difference]: Finished difference Result 4048 states and 6020 transitions. [2024-10-24 02:42:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-24 02:42:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:33,502 INFO L225 Difference]: With dead ends: 4048 [2024-10-24 02:42:33,502 INFO L226 Difference]: Without dead ends: 3662 [2024-10-24 02:42:33,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:42:33,504 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 3045 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:33,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 3130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2024-10-24 02:42:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3272. [2024-10-24 02:42:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3270 states have (on average 1.4996941896024465) internal successors, (4904), 3271 states have internal predecessors, (4904), 0 states have call successors, (0), 0 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-24 02:42:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4904 transitions. [2024-10-24 02:42:33,574 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4904 transitions. Word has length 52 [2024-10-24 02:42:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:33,575 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 4904 transitions. [2024-10-24 02:42:33,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4904 transitions. [2024-10-24 02:42:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 02:42:33,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:33,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:33,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 02:42:33,576 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:33,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:33,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1640470092, now seen corresponding path program 1 times [2024-10-24 02:42:33,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:33,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769813717] [2024-10-24 02:42:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:33,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:33,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769813717] [2024-10-24 02:42:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769813717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:33,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:33,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840830887] [2024-10-24 02:42:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:33,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:33,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:33,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:33,656 INFO L87 Difference]: Start difference. First operand 3272 states and 4904 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-24 02:42:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:33,733 INFO L93 Difference]: Finished difference Result 4140 states and 6130 transitions. [2024-10-24 02:42:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-24 02:42:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:33,739 INFO L225 Difference]: With dead ends: 4140 [2024-10-24 02:42:33,740 INFO L226 Difference]: Without dead ends: 2410 [2024-10-24 02:42:33,742 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-24 02:42:33,743 INFO L432 NwaCegarLoop]: 1522 mSDtfsCounter, 29 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:33,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3005 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2024-10-24 02:42:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2024-10-24 02:42:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2406 states have (on average 1.5220282626766417) internal successors, (3662), 2407 states have internal predecessors, (3662), 0 states have call successors, (0), 0 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-24 02:42:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3662 transitions. [2024-10-24 02:42:33,808 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3662 transitions. Word has length 53 [2024-10-24 02:42:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:33,809 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3662 transitions. [2024-10-24 02:42:33,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-24 02:42:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3662 transitions. [2024-10-24 02:42:33,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 02:42:33,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:33,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:33,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 02:42:33,810 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:33,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:33,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1012299426, now seen corresponding path program 1 times [2024-10-24 02:42:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395667184] [2024-10-24 02:42:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:33,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395667184] [2024-10-24 02:42:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395667184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855966521] [2024-10-24 02:42:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:33,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:33,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:33,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:33,906 INFO L87 Difference]: Start difference. First operand 2408 states and 3662 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:33,945 INFO L93 Difference]: Finished difference Result 2844 states and 4267 transitions. [2024-10-24 02:42:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:33,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-24 02:42:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:33,951 INFO L225 Difference]: With dead ends: 2844 [2024-10-24 02:42:33,951 INFO L226 Difference]: Without dead ends: 1978 [2024-10-24 02:42:33,953 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-24 02:42:33,953 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 26 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:33,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2990 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-10-24 02:42:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1976. [2024-10-24 02:42:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1974 states have (on average 1.5450861195542047) internal successors, (3050), 1975 states have internal predecessors, (3050), 0 states have call successors, (0), 0 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-24 02:42:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3050 transitions. [2024-10-24 02:42:34,001 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3050 transitions. Word has length 55 [2024-10-24 02:42:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:34,001 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 3050 transitions. [2024-10-24 02:42:34,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3050 transitions. [2024-10-24 02:42:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 02:42:34,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:34,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:34,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 02:42:34,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:34,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1129129232, now seen corresponding path program 1 times [2024-10-24 02:42:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:34,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465026703] [2024-10-24 02:42:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465026703] [2024-10-24 02:42:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465026703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017356933] [2024-10-24 02:42:35,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:35,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:35,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:35,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 02:42:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:35,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 02:42:35,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:42:35,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:42:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017356933] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:36,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-24 02:42:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375275649] [2024-10-24 02:42:36,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:36,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 02:42:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:36,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 02:42:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-24 02:42:36,060 INFO L87 Difference]: Start difference. First operand 1976 states and 3050 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-24 02:42:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:38,799 INFO L93 Difference]: Finished difference Result 4285 states and 6132 transitions. [2024-10-24 02:42:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-24 02:42:38,800 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-24 02:42:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:38,807 INFO L225 Difference]: With dead ends: 4285 [2024-10-24 02:42:38,807 INFO L226 Difference]: Without dead ends: 3851 [2024-10-24 02:42:38,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=719, Invalid=3063, Unknown=0, NotChecked=0, Total=3782 [2024-10-24 02:42:38,810 INFO L432 NwaCegarLoop]: 1492 mSDtfsCounter, 17155 mSDsluCounter, 6118 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17155 SdHoareTripleChecker+Valid, 7610 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:38,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17155 Valid, 7610 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 02:42:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2024-10-24 02:42:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3773. [2024-10-24 02:42:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3773 states, 3771 states have (on average 1.4041368337311058) internal successors, (5295), 3772 states have internal predecessors, (5295), 0 states have call successors, (0), 0 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-24 02:42:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 5295 transitions. [2024-10-24 02:42:38,913 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 5295 transitions. Word has length 57 [2024-10-24 02:42:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:38,914 INFO L471 AbstractCegarLoop]: Abstraction has 3773 states and 5295 transitions. [2024-10-24 02:42:38,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-24 02:42:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 5295 transitions. [2024-10-24 02:42:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 02:42:38,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:38,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:38,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 02:42:39,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 02:42:39,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2092021697, now seen corresponding path program 1 times [2024-10-24 02:42:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105602254] [2024-10-24 02:42:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:39,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:40,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105602254] [2024-10-24 02:42:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105602254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649470531] [2024-10-24 02:42:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:40,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:40,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:40,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:40,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 02:42:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:41,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 02:42:41,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:41,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649470531] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:42,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-24 02:42:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883967802] [2024-10-24 02:42:42,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:42,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 02:42:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 02:42:42,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-24 02:42:42,185 INFO L87 Difference]: Start difference. First operand 3773 states and 5295 transitions. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-24 02:42:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:42,761 INFO L93 Difference]: Finished difference Result 7800 states and 10468 transitions. [2024-10-24 02:42:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:42:42,762 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 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 58 [2024-10-24 02:42:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:42,772 INFO L225 Difference]: With dead ends: 7800 [2024-10-24 02:42:42,773 INFO L226 Difference]: Without dead ends: 5959 [2024-10-24 02:42:42,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 02:42:42,778 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 16628 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16628 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:42,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16628 Valid, 4682 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 02:42:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2024-10-24 02:42:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 5893. [2024-10-24 02:42:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 5891 states have (on average 1.3427261924970293) internal successors, (7910), 5892 states have internal predecessors, (7910), 0 states have call successors, (0), 0 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-24 02:42:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 7910 transitions. [2024-10-24 02:42:42,932 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 7910 transitions. Word has length 58 [2024-10-24 02:42:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:42,933 INFO L471 AbstractCegarLoop]: Abstraction has 5893 states and 7910 transitions. [2024-10-24 02:42:42,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-24 02:42:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 7910 transitions. [2024-10-24 02:42:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 02:42:42,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:42,936 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:42,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 02:42:43,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 02:42:43,141 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:43,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1421483023, now seen corresponding path program 1 times [2024-10-24 02:42:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163649926] [2024-10-24 02:42:43,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163649926] [2024-10-24 02:42:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163649926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:43,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307677687] [2024-10-24 02:42:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:43,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:43,494 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:43,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 02:42:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:43,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 02:42:43,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:44,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:45,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307677687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:45,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:45,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-10-24 02:42:45,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433471614] [2024-10-24 02:42:45,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:45,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-24 02:42:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-24 02:42:45,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-10-24 02:42:45,041 INFO L87 Difference]: Start difference. First operand 5893 states and 7910 transitions. Second operand has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-24 02:42:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:47,700 INFO L93 Difference]: Finished difference Result 15452 states and 20018 transitions. [2024-10-24 02:42:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-24 02:42:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 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 58 [2024-10-24 02:42:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:47,721 INFO L225 Difference]: With dead ends: 15452 [2024-10-24 02:42:47,721 INFO L226 Difference]: Without dead ends: 11590 [2024-10-24 02:42:47,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-10-24 02:42:47,733 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 15605 mSDsluCounter, 13951 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15605 SdHoareTripleChecker+Valid, 15453 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:47,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15605 Valid, 15453 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 02:42:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11590 states. [2024-10-24 02:42:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11590 to 7928. [2024-10-24 02:42:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7928 states, 7926 states have (on average 1.3115064345193035) internal successors, (10395), 7927 states have internal predecessors, (10395), 0 states have call successors, (0), 0 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-24 02:42:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 10395 transitions. [2024-10-24 02:42:48,006 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 10395 transitions. Word has length 58 [2024-10-24 02:42:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:48,007 INFO L471 AbstractCegarLoop]: Abstraction has 7928 states and 10395 transitions. [2024-10-24 02:42:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-24 02:42:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 10395 transitions. [2024-10-24 02:42:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 02:42:48,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:48,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:48,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 02:42:48,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:48,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:48,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 572180868, now seen corresponding path program 1 times [2024-10-24 02:42:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:48,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132297763] [2024-10-24 02:42:48,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:48,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132297763] [2024-10-24 02:42:48,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132297763] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:48,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916520226] [2024-10-24 02:42:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:48,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:48,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:48,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 02:42:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:48,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 02:42:48,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:49,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916520226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:49,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-24 02:42:49,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343068948] [2024-10-24 02:42:49,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:49,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 02:42:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:49,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 02:42:49,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-24 02:42:49,425 INFO L87 Difference]: Start difference. First operand 7928 states and 10395 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-24 02:42:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:49,943 INFO L93 Difference]: Finished difference Result 13504 states and 17416 transitions. [2024-10-24 02:42:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 02:42:49,943 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-24 02:42:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:49,959 INFO L225 Difference]: With dead ends: 13504 [2024-10-24 02:42:49,959 INFO L226 Difference]: Without dead ends: 8244 [2024-10-24 02:42:49,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2024-10-24 02:42:49,969 INFO L432 NwaCegarLoop]: 1495 mSDtfsCounter, 10579 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10579 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:49,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10579 Valid, 4683 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 02:42:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8244 states. [2024-10-24 02:42:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8244 to 7852. [2024-10-24 02:42:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7852 states, 7850 states have (on average 1.301656050955414) internal successors, (10218), 7851 states have internal predecessors, (10218), 0 states have call successors, (0), 0 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-24 02:42:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7852 states to 7852 states and 10218 transitions. [2024-10-24 02:42:50,352 INFO L78 Accepts]: Start accepts. Automaton has 7852 states and 10218 transitions. Word has length 59 [2024-10-24 02:42:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:50,353 INFO L471 AbstractCegarLoop]: Abstraction has 7852 states and 10218 transitions. [2024-10-24 02:42:50,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-24 02:42:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7852 states and 10218 transitions. [2024-10-24 02:42:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 02:42:50,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:50,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:50,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 02:42:50,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:50,555 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:50,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash 49576658, now seen corresponding path program 1 times [2024-10-24 02:42:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:50,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575533024] [2024-10-24 02:42:50,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:51,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575533024] [2024-10-24 02:42:51,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575533024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233295753] [2024-10-24 02:42:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:51,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:51,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:51,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:51,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 02:42:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:51,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-24 02:42:51,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:52,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233295753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:54,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 43 [2024-10-24 02:42:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183916256] [2024-10-24 02:42:54,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:54,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-24 02:42:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-24 02:42:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2024-10-24 02:42:54,962 INFO L87 Difference]: Start difference. First operand 7852 states and 10218 transitions. Second operand has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-24 02:43:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:43:01,643 INFO L93 Difference]: Finished difference Result 10066 states and 13001 transitions. [2024-10-24 02:43:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-24 02:43:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-24 02:43:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:43:01,656 INFO L225 Difference]: With dead ends: 10066 [2024-10-24 02:43:01,657 INFO L226 Difference]: Without dead ends: 6575 [2024-10-24 02:43:01,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2067, Invalid=8033, Unknown=0, NotChecked=0, Total=10100 [2024-10-24 02:43:01,665 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 14514 mSDsluCounter, 21637 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14514 SdHoareTripleChecker+Valid, 23160 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:43:01,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14514 Valid, 23160 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 02:43:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2024-10-24 02:43:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 6213. [2024-10-24 02:43:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 6211 states have (on average 1.3179842215424247) internal successors, (8186), 6212 states have internal predecessors, (8186), 0 states have call successors, (0), 0 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-24 02:43:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 8186 transitions. [2024-10-24 02:43:01,881 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 8186 transitions. Word has length 59 [2024-10-24 02:43:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:43:01,881 INFO L471 AbstractCegarLoop]: Abstraction has 6213 states and 8186 transitions. [2024-10-24 02:43:01,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-24 02:43:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 8186 transitions. [2024-10-24 02:43:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 02:43:01,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:43:01,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:43:01,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 02:43:02,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:43:02,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:43:02,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:43:02,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1839133400, now seen corresponding path program 1 times [2024-10-24 02:43:02,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:43:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577441475] [2024-10-24 02:43:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:43:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:43:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577441475] [2024-10-24 02:43:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577441475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:43:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030235315] [2024-10-24 02:43:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:43:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:43:03,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:43:03,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 02:43:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:03,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 02:43:03,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:43:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:07,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:43:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030235315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:43:10,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:43:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 57 [2024-10-24 02:43:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035396418] [2024-10-24 02:43:10,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:43:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-24 02:43:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:43:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-24 02:43:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2885, Unknown=0, NotChecked=0, Total=3192 [2024-10-24 02:43:10,496 INFO L87 Difference]: Start difference. First operand 6213 states and 8186 transitions. Second operand has 57 states, 57 states have (on average 2.824561403508772) internal successors, (161), 57 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)