./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.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 c505ae1adfc08ba258d60bd75ac11e8743fcfab06e2df8bbc0556c70ed343ff7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:41:47,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:41:47,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:41:47,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:41:47,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:41:47,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:41:47,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:41:47,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:41:47,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:41:47,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:41:47,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:41:47,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:41:47,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:41:47,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:41:47,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:41:47,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:41:47,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:41:47,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:41:47,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:41:47,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:41:47,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:41:47,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:41:47,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:41:47,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:41:47,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:41:47,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:41:47,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:41:47,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:41:47,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:41:47,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:41:47,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:41:47,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:41:47,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:41:47,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:41:47,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:41:47,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:41:47,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:41:47,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:41:47,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:41:47,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:41:47,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:41:47,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:41:47,936 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 -> c505ae1adfc08ba258d60bd75ac11e8743fcfab06e2df8bbc0556c70ed343ff7 [2024-11-16 09:41:48,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:41:48,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:41:48,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:41:48,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:41:48,217 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:41:48,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-16 09:41:49,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:41:50,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:41:50,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-16 09:41:50,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4fd6de/98d65b2e863d4bc8bc6082d3ad87f769/FLAG67c1542ee [2024-11-16 09:41:50,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4fd6de/98d65b2e863d4bc8bc6082d3ad87f769 [2024-11-16 09:41:50,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:41:50,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:41:50,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:41:50,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:41:50,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:41:50,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:41:50" (1/1) ... [2024-11-16 09:41:50,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bae36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:50, skipping insertion in model container [2024-11-16 09:41:50,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:41:50" (1/1) ... [2024-11-16 09:41:50,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:41:50,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[11668,11681] [2024-11-16 09:41:50,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[18958,18971] [2024-11-16 09:41:51,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:41:51,598 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:41:51,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[11668,11681] [2024-11-16 09:41:51,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[18958,18971] [2024-11-16 09:41:52,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:41:52,054 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:41:52,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52 WrapperNode [2024-11-16 09:41:52,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:41:52,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:41:52,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:41:52,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:41:52,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,447 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5095 [2024-11-16 09:41:52,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:41:52,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:41:52,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:41:52,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:41:52,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,744 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 09:41:52,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:52,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:53,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:41:53,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:41:53,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:41:53,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:41:53,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (1/1) ... [2024-11-16 09:41:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:41:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:41:53,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 09:41:53,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 09:41:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:41:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:41:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:41:53,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:41:53,213 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:41:53,215 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:41:57,533 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2024-11-16 09:41:57,534 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2024-11-16 09:41:57,534 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2024-11-16 09:41:57,689 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2024-11-16 09:41:57,690 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:41:57,732 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:41:57,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:41:57,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:41:57 BoogieIcfgContainer [2024-11-16 09:41:57,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:41:57,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:41:57,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:41:57,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:41:57,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:41:50" (1/3) ... [2024-11-16 09:41:57,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4c0a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:41:57, skipping insertion in model container [2024-11-16 09:41:57,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:52" (2/3) ... [2024-11-16 09:41:57,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4c0a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:41:57, skipping insertion in model container [2024-11-16 09:41:57,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:41:57" (3/3) ... [2024-11-16 09:41:57,742 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-16 09:41:57,758 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:41:57,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:41:57,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:41:57,859 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;@4055b2b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:41:57,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:41:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 908 states, 905 states have (on average 1.8972375690607735) internal successors, (1717), 907 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 09:41:57,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:41:57,881 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] [2024-11-16 09:41:57,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:41:57,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:41:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1541591592, now seen corresponding path program 1 times [2024-11-16 09:41:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:41:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340395068] [2024-11-16 09:41:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:41:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:41:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:41:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:41:58,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:41:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340395068] [2024-11-16 09:41:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340395068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:41:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:41:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:41:58,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803859151] [2024-11-16 09:41:58,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:41:58,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:41:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:41:58,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:41:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:41:58,206 INFO L87 Difference]: Start difference. First operand has 908 states, 905 states have (on average 1.8972375690607735) internal successors, (1717), 907 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:41:58,299 INFO L93 Difference]: Finished difference Result 1775 states and 3360 transitions. [2024-11-16 09:41:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:41:58,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-16 09:41:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:41:58,328 INFO L225 Difference]: With dead ends: 1775 [2024-11-16 09:41:58,329 INFO L226 Difference]: Without dead ends: 840 [2024-11-16 09:41:58,336 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-11-16 09:41:58,339 INFO L432 NwaCegarLoop]: 1646 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:41:58,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:41:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-16 09:41:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-16 09:41:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.8878281622911695) internal successors, (1582), 839 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1582 transitions. [2024-11-16 09:41:58,437 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1582 transitions. Word has length 26 [2024-11-16 09:41:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:41:58,438 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1582 transitions. [2024-11-16 09:41:58,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1582 transitions. [2024-11-16 09:41:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 09:41:58,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:41:58,441 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] [2024-11-16 09:41:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:41:58,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:41:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:41:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1950415817, now seen corresponding path program 1 times [2024-11-16 09:41:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:41:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569669125] [2024-11-16 09:41:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:41:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:41:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:41:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:41:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:41:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569669125] [2024-11-16 09:41:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569669125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:41:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:41:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:41:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043263997] [2024-11-16 09:41:58,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:41:58,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:41:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:41:58,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:41:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:41:58,683 INFO L87 Difference]: Start difference. First operand 840 states and 1582 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:41:58,843 INFO L93 Difference]: Finished difference Result 891 states and 1659 transitions. [2024-11-16 09:41:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:41:58,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-16 09:41:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:41:58,848 INFO L225 Difference]: With dead ends: 891 [2024-11-16 09:41:58,848 INFO L226 Difference]: Without dead ends: 840 [2024-11-16 09:41:58,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:41:58,851 INFO L432 NwaCegarLoop]: 1580 mSDtfsCounter, 0 mSDsluCounter, 4704 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6284 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:41:58,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6284 Invalid, 43 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:41:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-16 09:41:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-16 09:41:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.8508353221957041) internal successors, (1551), 839 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1551 transitions. [2024-11-16 09:41:58,873 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1551 transitions. Word has length 26 [2024-11-16 09:41:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:41:58,874 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1551 transitions. [2024-11-16 09:41:58,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1551 transitions. [2024-11-16 09:41:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 09:41:58,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:41:58,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:41:58,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:41:58,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:41:58,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:41:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1916981497, now seen corresponding path program 1 times [2024-11-16 09:41:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:41:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289614223] [2024-11-16 09:41:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:41:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:41:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:41:59,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-11-16 09:41:59,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:41:59,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289614223] [2024-11-16 09:41:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289614223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:41:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:41:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:41:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287263593] [2024-11-16 09:41:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:41:59,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:41:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:41:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:41:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:41:59,195 INFO L87 Difference]: Start difference. First operand 840 states and 1551 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:41:59,531 INFO L93 Difference]: Finished difference Result 1310 states and 2281 transitions. [2024-11-16 09:41:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 09:41:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-16 09:41:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:41:59,539 INFO L225 Difference]: With dead ends: 1310 [2024-11-16 09:41:59,540 INFO L226 Difference]: Without dead ends: 1263 [2024-11-16 09:41:59,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-16 09:41:59,544 INFO L432 NwaCegarLoop]: 1545 mSDtfsCounter, 8019 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8019 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:41:59,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8019 Valid, 2755 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:41:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-16 09:41:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 884. [2024-11-16 09:41:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 882 states have (on average 1.836734693877551) internal successors, (1620), 883 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1620 transitions. [2024-11-16 09:41:59,578 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1620 transitions. Word has length 56 [2024-11-16 09:41:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:41:59,578 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1620 transitions. [2024-11-16 09:41:59,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:41:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1620 transitions. [2024-11-16 09:41:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:41:59,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:41:59,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:41:59,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:41:59,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:41:59,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:41:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1967609179, now seen corresponding path program 1 times [2024-11-16 09:41:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:41:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079854744] [2024-11-16 09:41:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:41:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:41:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:41:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:41:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:41:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079854744] [2024-11-16 09:41:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079854744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:41:59,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:41:59,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:41:59,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147192162] [2024-11-16 09:41:59,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:41:59,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:41:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:41:59,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:41:59,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:41:59,982 INFO L87 Difference]: Start difference. First operand 884 states and 1620 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:00,193 INFO L93 Difference]: Finished difference Result 978 states and 1764 transitions. [2024-11-16 09:42:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:42:00,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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-11-16 09:42:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:00,198 INFO L225 Difference]: With dead ends: 978 [2024-11-16 09:42:00,198 INFO L226 Difference]: Without dead ends: 887 [2024-11-16 09:42:00,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:42:00,200 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 4500 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4500 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:00,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4500 Valid, 1821 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:42:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-16 09:42:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2024-11-16 09:42:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 882 states have (on average 1.8356009070294785) internal successors, (1619), 883 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1619 transitions. [2024-11-16 09:42:00,222 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1619 transitions. Word has length 58 [2024-11-16 09:42:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:00,222 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1619 transitions. [2024-11-16 09:42:00,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1619 transitions. [2024-11-16 09:42:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 09:42:00,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:00,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:00,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:42:00,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:00,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1704805686, now seen corresponding path program 1 times [2024-11-16 09:42:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442147901] [2024-11-16 09:42:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:00,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:00,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442147901] [2024-11-16 09:42:00,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442147901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331329215] [2024-11-16 09:42:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:00,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,323 INFO L87 Difference]: Start difference. First operand 884 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:00,361 INFO L93 Difference]: Finished difference Result 1054 states and 1881 transitions. [2024-11-16 09:42:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:00,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-16 09:42:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:00,366 INFO L225 Difference]: With dead ends: 1054 [2024-11-16 09:42:00,366 INFO L226 Difference]: Without dead ends: 963 [2024-11-16 09:42:00,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,367 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1488 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:00,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1613 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-16 09:42:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 958. [2024-11-16 09:42:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 956 states have (on average 1.8106694560669456) internal successors, (1731), 957 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1731 transitions. [2024-11-16 09:42:00,390 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1731 transitions. Word has length 59 [2024-11-16 09:42:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:00,390 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1731 transitions. [2024-11-16 09:42:00,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1731 transitions. [2024-11-16 09:42:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:42:00,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:00,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:00,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:42:00,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:00,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash -868455267, now seen corresponding path program 1 times [2024-11-16 09:42:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:00,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071950100] [2024-11-16 09:42:00,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:00,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:00,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:00,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071950100] [2024-11-16 09:42:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071950100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:00,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976063737] [2024-11-16 09:42:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:00,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:00,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,500 INFO L87 Difference]: Start difference. First operand 958 states and 1731 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:00,559 INFO L93 Difference]: Finished difference Result 1272 states and 2209 transitions. [2024-11-16 09:42:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-16 09:42:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:00,564 INFO L225 Difference]: With dead ends: 1272 [2024-11-16 09:42:00,564 INFO L226 Difference]: Without dead ends: 1107 [2024-11-16 09:42:00,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,567 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 1501 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:00,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1678 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-11-16 09:42:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1104. [2024-11-16 09:42:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1102 states have (on average 1.7695099818511797) internal successors, (1950), 1103 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1950 transitions. [2024-11-16 09:42:00,595 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1950 transitions. Word has length 60 [2024-11-16 09:42:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:00,595 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1950 transitions. [2024-11-16 09:42:00,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1950 transitions. [2024-11-16 09:42:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:42:00,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:00,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:00,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:42:00,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:00,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1869864995, now seen corresponding path program 1 times [2024-11-16 09:42:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:00,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469684886] [2024-11-16 09:42:00,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:00,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:00,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:00,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469684886] [2024-11-16 09:42:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469684886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:00,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:00,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899512032] [2024-11-16 09:42:00,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:00,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,709 INFO L87 Difference]: Start difference. First operand 1104 states and 1950 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:00,745 INFO L93 Difference]: Finished difference Result 1694 states and 2838 transitions. [2024-11-16 09:42:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:00,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-16 09:42:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:00,752 INFO L225 Difference]: With dead ends: 1694 [2024-11-16 09:42:00,752 INFO L226 Difference]: Without dead ends: 1383 [2024-11-16 09:42:00,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,754 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 1499 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:00,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1680 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-16 09:42:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2024-11-16 09:42:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1378 states have (on average 1.7097242380261248) internal successors, (2356), 1379 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2356 transitions. [2024-11-16 09:42:00,789 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2356 transitions. Word has length 60 [2024-11-16 09:42:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:00,789 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2356 transitions. [2024-11-16 09:42:00,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2356 transitions. [2024-11-16 09:42:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:42:00,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:00,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:00,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:42:00,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:00,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1884314851, now seen corresponding path program 1 times [2024-11-16 09:42:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245919533] [2024-11-16 09:42:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:00,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:00,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245919533] [2024-11-16 09:42:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245919533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:00,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920421781] [2024-11-16 09:42:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:00,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:00,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,870 INFO L87 Difference]: Start difference. First operand 1380 states and 2356 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:00,906 INFO L93 Difference]: Finished difference Result 2490 states and 4000 transitions. [2024-11-16 09:42:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:00,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-16 09:42:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:00,914 INFO L225 Difference]: With dead ends: 2490 [2024-11-16 09:42:00,914 INFO L226 Difference]: Without dead ends: 1903 [2024-11-16 09:42:00,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:00,916 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1497 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:00,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1682 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-11-16 09:42:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1900. [2024-11-16 09:42:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1898 states have (on average 1.6354056902002108) internal successors, (3104), 1899 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 3104 transitions. [2024-11-16 09:42:00,957 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 3104 transitions. Word has length 60 [2024-11-16 09:42:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:00,958 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 3104 transitions. [2024-11-16 09:42:00,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3104 transitions. [2024-11-16 09:42:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:42:00,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:00,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:00,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:42:00,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:00,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash 207287901, now seen corresponding path program 1 times [2024-11-16 09:42:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:00,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406889050] [2024-11-16 09:42:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406889050] [2024-11-16 09:42:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406889050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:01,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:01,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:01,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338666550] [2024-11-16 09:42:01,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:01,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:01,037 INFO L87 Difference]: Start difference. First operand 1900 states and 3104 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:01,087 INFO L93 Difference]: Finished difference Result 3986 states and 6132 transitions. [2024-11-16 09:42:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:01,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-16 09:42:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:01,102 INFO L225 Difference]: With dead ends: 3986 [2024-11-16 09:42:01,102 INFO L226 Difference]: Without dead ends: 2879 [2024-11-16 09:42:01,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:01,106 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 1495 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:01,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1684 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2024-11-16 09:42:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2876. [2024-11-16 09:42:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.5560194850382743) internal successors, (4472), 2875 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4472 transitions. [2024-11-16 09:42:01,180 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4472 transitions. Word has length 60 [2024-11-16 09:42:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:01,180 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4472 transitions. [2024-11-16 09:42:01,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4472 transitions. [2024-11-16 09:42:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:42:01,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:01,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:42:01,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash -316989154, now seen corresponding path program 1 times [2024-11-16 09:42:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730550979] [2024-11-16 09:42:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730550979] [2024-11-16 09:42:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730550979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:01,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:01,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:42:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444374340] [2024-11-16 09:42:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:42:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:42:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:42:01,400 INFO L87 Difference]: Start difference. First operand 2876 states and 4472 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:01,493 INFO L93 Difference]: Finished difference Result 2975 states and 4602 transitions. [2024-11-16 09:42:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 09:42:01,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-16 09:42:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:01,503 INFO L225 Difference]: With dead ends: 2975 [2024-11-16 09:42:01,504 INFO L226 Difference]: Without dead ends: 2972 [2024-11-16 09:42:01,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:42:01,506 INFO L432 NwaCegarLoop]: 1545 mSDtfsCounter, 0 mSDsluCounter, 9257 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10802 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:01,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10802 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2024-11-16 09:42:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2972. [2024-11-16 09:42:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2970 states have (on average 1.5326599326599326) internal successors, (4552), 2971 states have internal predecessors, (4552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4552 transitions. [2024-11-16 09:42:01,573 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4552 transitions. Word has length 60 [2024-11-16 09:42:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:01,573 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 4552 transitions. [2024-11-16 09:42:01,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4552 transitions. [2024-11-16 09:42:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 09:42:01,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:01,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:01,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:42:01,577 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:01,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash 852820285, now seen corresponding path program 1 times [2024-11-16 09:42:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:01,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897542124] [2024-11-16 09:42:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:01,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:01,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897542124] [2024-11-16 09:42:01,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897542124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:01,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:01,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155161527] [2024-11-16 09:42:01,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:01,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:01,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:01,630 INFO L87 Difference]: Start difference. First operand 2972 states and 4552 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:01,684 INFO L93 Difference]: Finished difference Result 5286 states and 7857 transitions. [2024-11-16 09:42:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:01,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-16 09:42:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:01,699 INFO L225 Difference]: With dead ends: 5286 [2024-11-16 09:42:01,699 INFO L226 Difference]: Without dead ends: 4034 [2024-11-16 09:42:01,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:01,703 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 1500 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:01,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1679 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2024-11-16 09:42:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4031. [2024-11-16 09:42:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 4029 states have (on average 1.491933482253661) internal successors, (6011), 4030 states have internal predecessors, (6011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 6011 transitions. [2024-11-16 09:42:01,869 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 6011 transitions. Word has length 62 [2024-11-16 09:42:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:01,870 INFO L471 AbstractCegarLoop]: Abstraction has 4031 states and 6011 transitions. [2024-11-16 09:42:01,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 6011 transitions. [2024-11-16 09:42:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-16 09:42:01,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:01,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:01,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:42:01,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:01,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1741666752, now seen corresponding path program 1 times [2024-11-16 09:42:01,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:01,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897550401] [2024-11-16 09:42:01,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:02,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:02,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897550401] [2024-11-16 09:42:02,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897550401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:02,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:02,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125503659] [2024-11-16 09:42:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:42:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:42:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:42:02,018 INFO L87 Difference]: Start difference. First operand 4031 states and 6011 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:07,440 INFO L93 Difference]: Finished difference Result 6290 states and 10324 transitions. [2024-11-16 09:42:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:42:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-16 09:42:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:07,464 INFO L225 Difference]: With dead ends: 6290 [2024-11-16 09:42:07,464 INFO L226 Difference]: Without dead ends: 5535 [2024-11-16 09:42:07,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:42:07,467 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 2415 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2415 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:07,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2415 Valid, 828 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-16 09:42:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2024-11-16 09:42:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5535. [2024-11-16 09:42:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5533 states have (on average 1.4438821615759985) internal successors, (7989), 5534 states have internal predecessors, (7989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 7989 transitions. [2024-11-16 09:42:07,601 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 7989 transitions. Word has length 65 [2024-11-16 09:42:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:07,601 INFO L471 AbstractCegarLoop]: Abstraction has 5535 states and 7989 transitions. [2024-11-16 09:42:07,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 7989 transitions. [2024-11-16 09:42:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 09:42:07,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:07,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:42:07,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:07,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:07,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1095794021, now seen corresponding path program 1 times [2024-11-16 09:42:07,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553914887] [2024-11-16 09:42:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:07,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 09:42:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553914887] [2024-11-16 09:42:07,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553914887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:07,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:42:07,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515618475] [2024-11-16 09:42:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:07,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:42:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:42:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:42:07,839 INFO L87 Difference]: Start difference. First operand 5535 states and 7989 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:08,350 INFO L93 Difference]: Finished difference Result 22417 states and 31585 transitions. [2024-11-16 09:42:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:42:08,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-16 09:42:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:08,407 INFO L225 Difference]: With dead ends: 22417 [2024-11-16 09:42:08,407 INFO L226 Difference]: Without dead ends: 19182 [2024-11-16 09:42:08,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:42:08,421 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 6360 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6360 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:08,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6360 Valid, 3672 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:42:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19182 states. [2024-11-16 09:42:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19182 to 8767. [2024-11-16 09:42:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8767 states, 8765 states have (on average 1.4225898459783228) internal successors, (12469), 8766 states have internal predecessors, (12469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8767 states to 8767 states and 12469 transitions. [2024-11-16 09:42:08,811 INFO L78 Accepts]: Start accepts. Automaton has 8767 states and 12469 transitions. Word has length 81 [2024-11-16 09:42:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:08,812 INFO L471 AbstractCegarLoop]: Abstraction has 8767 states and 12469 transitions. [2024-11-16 09:42:08,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8767 states and 12469 transitions. [2024-11-16 09:42:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 09:42:08,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:08,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:08,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:42:08,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:08,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 94384293, now seen corresponding path program 1 times [2024-11-16 09:42:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975396723] [2024-11-16 09:42:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 09:42:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975396723] [2024-11-16 09:42:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975396723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:42:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985622134] [2024-11-16 09:42:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:08,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:42:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:42:08,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:42:08,977 INFO L87 Difference]: Start difference. First operand 8767 states and 12469 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:09,480 INFO L93 Difference]: Finished difference Result 25649 states and 36065 transitions. [2024-11-16 09:42:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:42:09,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 81 [2024-11-16 09:42:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:09,520 INFO L225 Difference]: With dead ends: 25649 [2024-11-16 09:42:09,520 INFO L226 Difference]: Without dead ends: 22414 [2024-11-16 09:42:09,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:42:09,529 INFO L432 NwaCegarLoop]: 1619 mSDtfsCounter, 6382 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6382 SdHoareTripleChecker+Valid, 3613 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:09,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6382 Valid, 3613 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:42:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22414 states. [2024-11-16 09:42:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22414 to 13631. [2024-11-16 09:42:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13631 states, 13629 states have (on average 1.4056056937412869) internal successors, (19157), 13630 states have internal predecessors, (19157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13631 states to 13631 states and 19157 transitions. [2024-11-16 09:42:09,926 INFO L78 Accepts]: Start accepts. Automaton has 13631 states and 19157 transitions. Word has length 81 [2024-11-16 09:42:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:09,926 INFO L471 AbstractCegarLoop]: Abstraction has 13631 states and 19157 transitions. [2024-11-16 09:42:09,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 13631 states and 19157 transitions. [2024-11-16 09:42:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 09:42:09,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:09,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:42:09,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash 79934437, now seen corresponding path program 1 times [2024-11-16 09:42:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131635283] [2024-11-16 09:42:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 09:42:10,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:10,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131635283] [2024-11-16 09:42:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131635283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:10,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:10,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:42:10,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938129782] [2024-11-16 09:42:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:10,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:42:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:42:10,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:42:10,090 INFO L87 Difference]: Start difference. First operand 13631 states and 19157 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:10,728 INFO L93 Difference]: Finished difference Result 28881 states and 40545 transitions. [2024-11-16 09:42:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:42:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 81 [2024-11-16 09:42:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:10,775 INFO L225 Difference]: With dead ends: 28881 [2024-11-16 09:42:10,775 INFO L226 Difference]: Without dead ends: 25646 [2024-11-16 09:42:10,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:42:10,787 INFO L432 NwaCegarLoop]: 1615 mSDtfsCounter, 6425 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6425 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:10,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6425 Valid, 3592 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:42:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25646 states. [2024-11-16 09:42:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25646 to 16863. [2024-11-16 09:42:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16863 states, 16861 states have (on average 1.4018741474408398) internal successors, (23637), 16862 states have internal predecessors, (23637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16863 states to 16863 states and 23637 transitions. [2024-11-16 09:42:11,264 INFO L78 Accepts]: Start accepts. Automaton has 16863 states and 23637 transitions. Word has length 81 [2024-11-16 09:42:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:11,265 INFO L471 AbstractCegarLoop]: Abstraction has 16863 states and 23637 transitions. [2024-11-16 09:42:11,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16863 states and 23637 transitions. [2024-11-16 09:42:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 09:42:11,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:11,268 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:11,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:42:11,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:11,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2123430107, now seen corresponding path program 1 times [2024-11-16 09:42:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:11,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579720515] [2024-11-16 09:42:11,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 09:42:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579720515] [2024-11-16 09:42:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579720515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:11,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:11,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:42:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550528814] [2024-11-16 09:42:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:11,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:42:11,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:42:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:42:11,432 INFO L87 Difference]: Start difference. First operand 16863 states and 23637 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:12,011 INFO L93 Difference]: Finished difference Result 32113 states and 45025 transitions. [2024-11-16 09:42:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:42:12,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2024-11-16 09:42:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:12,068 INFO L225 Difference]: With dead ends: 32113 [2024-11-16 09:42:12,068 INFO L226 Difference]: Without dead ends: 28878 [2024-11-16 09:42:12,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:42:12,080 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 6370 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6370 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:12,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6370 Valid, 3652 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:42:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28878 states. [2024-11-16 09:42:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28878 to 20095. [2024-11-16 09:42:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20095 states, 20093 states have (on average 1.3993430547952024) internal successors, (28117), 20094 states have internal predecessors, (28117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20095 states to 20095 states and 28117 transitions. [2024-11-16 09:42:12,597 INFO L78 Accepts]: Start accepts. Automaton has 20095 states and 28117 transitions. Word has length 81 [2024-11-16 09:42:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:12,597 INFO L471 AbstractCegarLoop]: Abstraction has 20095 states and 28117 transitions. [2024-11-16 09:42:12,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20095 states and 28117 transitions. [2024-11-16 09:42:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 09:42:12,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:12,601 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:12,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:42:12,601 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:12,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1214540089, now seen corresponding path program 1 times [2024-11-16 09:42:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:12,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048118331] [2024-11-16 09:42:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:12,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048118331] [2024-11-16 09:42:12,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048118331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:12,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:12,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760672168] [2024-11-16 09:42:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:12,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:12,797 INFO L87 Difference]: Start difference. First operand 20095 states and 28117 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:13,155 INFO L93 Difference]: Finished difference Result 32795 states and 45920 transitions. [2024-11-16 09:42:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:13,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-16 09:42:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:13,189 INFO L225 Difference]: With dead ends: 32795 [2024-11-16 09:42:13,189 INFO L226 Difference]: Without dead ends: 15000 [2024-11-16 09:42:13,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:13,211 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 51 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:13,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 3129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2024-11-16 09:42:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 14997. [2024-11-16 09:42:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14997 states, 14995 states have (on average 1.406002000666889) internal successors, (21083), 14996 states have internal predecessors, (21083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14997 states to 14997 states and 21083 transitions. [2024-11-16 09:42:13,693 INFO L78 Accepts]: Start accepts. Automaton has 14997 states and 21083 transitions. Word has length 83 [2024-11-16 09:42:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:13,694 INFO L471 AbstractCegarLoop]: Abstraction has 14997 states and 21083 transitions. [2024-11-16 09:42:13,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14997 states and 21083 transitions. [2024-11-16 09:42:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 09:42:13,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:13,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:13,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 09:42:13,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:13,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1289224187, now seen corresponding path program 1 times [2024-11-16 09:42:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441581763] [2024-11-16 09:42:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 09:42:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441581763] [2024-11-16 09:42:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441581763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:13,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 09:42:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800323911] [2024-11-16 09:42:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:13,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 09:42:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:13,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 09:42:13,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:42:13,852 INFO L87 Difference]: Start difference. First operand 14997 states and 21083 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:14,274 INFO L93 Difference]: Finished difference Result 26535 states and 37255 transitions. [2024-11-16 09:42:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:42:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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 83 [2024-11-16 09:42:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:14,310 INFO L225 Difference]: With dead ends: 26535 [2024-11-16 09:42:14,311 INFO L226 Difference]: Without dead ends: 24228 [2024-11-16 09:42:14,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 09:42:14,323 INFO L432 NwaCegarLoop]: 1613 mSDtfsCounter, 6369 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3786 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:14,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3786 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:42:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24228 states. [2024-11-16 09:42:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24228 to 17301. [2024-11-16 09:42:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17301 states, 17299 states have (on average 1.4037227585409562) internal successors, (24283), 17300 states have internal predecessors, (24283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 24283 transitions. [2024-11-16 09:42:14,846 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 24283 transitions. Word has length 83 [2024-11-16 09:42:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:14,847 INFO L471 AbstractCegarLoop]: Abstraction has 17301 states and 24283 transitions. [2024-11-16 09:42:14,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 24283 transitions. [2024-11-16 09:42:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 09:42:14,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:14,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:14,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 09:42:14,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:14,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash 295498087, now seen corresponding path program 1 times [2024-11-16 09:42:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:14,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693672259] [2024-11-16 09:42:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:14,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693672259] [2024-11-16 09:42:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693672259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:14,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:14,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:14,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848578548] [2024-11-16 09:42:14,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:14,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:14,966 INFO L87 Difference]: Start difference. First operand 17301 states and 24283 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:15,142 INFO L93 Difference]: Finished difference Result 24795 states and 34687 transitions. [2024-11-16 09:42:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:15,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-16 09:42:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:15,159 INFO L225 Difference]: With dead ends: 24795 [2024-11-16 09:42:15,159 INFO L226 Difference]: Without dead ends: 9816 [2024-11-16 09:42:15,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:15,175 INFO L432 NwaCegarLoop]: 1586 mSDtfsCounter, 44 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:15,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2024-11-16 09:42:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 9813. [2024-11-16 09:42:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 9811 states have (on average 1.4044439914381817) internal successors, (13779), 9812 states have internal predecessors, (13779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 13779 transitions. [2024-11-16 09:42:15,408 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 13779 transitions. Word has length 85 [2024-11-16 09:42:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:15,409 INFO L471 AbstractCegarLoop]: Abstraction has 9813 states and 13779 transitions. [2024-11-16 09:42:15,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 13779 transitions. [2024-11-16 09:42:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-16 09:42:15,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:15,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:15,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 09:42:15,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:15,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1449445975, now seen corresponding path program 1 times [2024-11-16 09:42:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:15,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067632254] [2024-11-16 09:42:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067632254] [2024-11-16 09:42:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067632254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:15,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:15,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642117074] [2024-11-16 09:42:15,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:15,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:15,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:15,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:15,528 INFO L87 Difference]: Start difference. First operand 9813 states and 13779 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:15,625 INFO L93 Difference]: Finished difference Result 13563 states and 18931 transitions. [2024-11-16 09:42:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:15,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-16 09:42:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:15,636 INFO L225 Difference]: With dead ends: 13563 [2024-11-16 09:42:15,636 INFO L226 Difference]: Without dead ends: 6072 [2024-11-16 09:42:15,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:15,647 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 39 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:15,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3099 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2024-11-16 09:42:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 6069. [2024-11-16 09:42:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6069 states, 6067 states have (on average 1.4140431844404153) internal successors, (8579), 6068 states have internal predecessors, (8579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 8579 transitions. [2024-11-16 09:42:15,773 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 8579 transitions. Word has length 87 [2024-11-16 09:42:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:15,773 INFO L471 AbstractCegarLoop]: Abstraction has 6069 states and 8579 transitions. [2024-11-16 09:42:15,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 8579 transitions. [2024-11-16 09:42:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 09:42:15,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:15,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:15,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 09:42:15,776 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1099430416, now seen corresponding path program 1 times [2024-11-16 09:42:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:15,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657698866] [2024-11-16 09:42:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:15,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657698866] [2024-11-16 09:42:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657698866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120728770] [2024-11-16 09:42:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:15,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:15,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:15,918 INFO L87 Difference]: Start difference. First operand 6069 states and 8579 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:15,977 INFO L93 Difference]: Finished difference Result 7947 states and 11131 transitions. [2024-11-16 09:42:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:15,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-16 09:42:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:15,983 INFO L225 Difference]: With dead ends: 7947 [2024-11-16 09:42:15,983 INFO L226 Difference]: Without dead ends: 4200 [2024-11-16 09:42:15,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:15,988 INFO L432 NwaCegarLoop]: 1572 mSDtfsCounter, 36 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:15,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2024-11-16 09:42:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 4197. [2024-11-16 09:42:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 4195 states have (on average 1.431466030989273) internal successors, (6005), 4196 states have internal predecessors, (6005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 6005 transitions. [2024-11-16 09:42:16,064 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 6005 transitions. Word has length 89 [2024-11-16 09:42:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:16,064 INFO L471 AbstractCegarLoop]: Abstraction has 4197 states and 6005 transitions. [2024-11-16 09:42:16,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 6005 transitions. [2024-11-16 09:42:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 09:42:16,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:16,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:16,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 09:42:16,067 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:16,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2136645527, now seen corresponding path program 1 times [2024-11-16 09:42:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:16,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660782743] [2024-11-16 09:42:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660782743] [2024-11-16 09:42:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660782743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:42:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:42:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:42:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32759377] [2024-11-16 09:42:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:42:16,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:42:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:16,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:42:16,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:16,160 INFO L87 Difference]: Start difference. First operand 4197 states and 6005 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:16,202 INFO L93 Difference]: Finished difference Result 5139 states and 7270 transitions. [2024-11-16 09:42:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:42:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-16 09:42:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:16,208 INFO L225 Difference]: With dead ends: 5139 [2024-11-16 09:42:16,208 INFO L226 Difference]: Without dead ends: 3264 [2024-11-16 09:42:16,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:42:16,211 INFO L432 NwaCegarLoop]: 1565 mSDtfsCounter, 33 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:16,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:42:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2024-11-16 09:42:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3261. [2024-11-16 09:42:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3261 states, 3259 states have (on average 1.4516722921141454) internal successors, (4731), 3260 states have internal predecessors, (4731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 3261 states and 4731 transitions. [2024-11-16 09:42:16,266 INFO L78 Accepts]: Start accepts. Automaton has 3261 states and 4731 transitions. Word has length 91 [2024-11-16 09:42:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:16,267 INFO L471 AbstractCegarLoop]: Abstraction has 3261 states and 4731 transitions. [2024-11-16 09:42:16,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 4731 transitions. [2024-11-16 09:42:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 09:42:16,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:16,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:16,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 09:42:16,269 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:16,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash 648648254, now seen corresponding path program 1 times [2024-11-16 09:42:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:16,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330119543] [2024-11-16 09:42:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330119543] [2024-11-16 09:42:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330119543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:42:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556764439] [2024-11-16 09:42:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:16,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:42:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:42:16,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:42:16,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 09:42:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:16,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 09:42:16,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:42:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:17,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:42:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:18,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556764439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:42:18,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:42:18,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-16 09:42:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702724921] [2024-11-16 09:42:18,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:42:18,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 09:42:18,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 09:42:18,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-16 09:42:18,629 INFO L87 Difference]: Start difference. First operand 3261 states and 4731 transitions. Second operand has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:20,183 INFO L93 Difference]: Finished difference Result 7286 states and 10101 transitions. [2024-11-16 09:42:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-16 09:42:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-16 09:42:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:20,191 INFO L225 Difference]: With dead ends: 7286 [2024-11-16 09:42:20,191 INFO L226 Difference]: Without dead ends: 6347 [2024-11-16 09:42:20,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2024-11-16 09:42:20,195 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 16259 mSDsluCounter, 6729 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16259 SdHoareTripleChecker+Valid, 8237 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:20,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16259 Valid, 8237 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 09:42:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2024-11-16 09:42:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6277. [2024-11-16 09:42:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6277 states, 6275 states have (on average 1.3754581673306774) internal successors, (8631), 6276 states have internal predecessors, (8631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6277 states to 6277 states and 8631 transitions. [2024-11-16 09:42:20,341 INFO L78 Accepts]: Start accepts. Automaton has 6277 states and 8631 transitions. Word has length 93 [2024-11-16 09:42:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:20,341 INFO L471 AbstractCegarLoop]: Abstraction has 6277 states and 8631 transitions. [2024-11-16 09:42:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6277 states and 8631 transitions. [2024-11-16 09:42:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 09:42:20,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:20,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:20,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 09:42:20,547 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,SelfDestructingSolverStorable22 [2024-11-16 09:42:20,548 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash -546060386, now seen corresponding path program 1 times [2024-11-16 09:42:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269366966] [2024-11-16 09:42:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:21,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:21,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269366966] [2024-11-16 09:42:21,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269366966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:42:21,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752017094] [2024-11-16 09:42:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:21,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:42:21,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:42:21,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:42:21,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 09:42:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:21,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 09:42:21,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:42:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:21,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:42:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752017094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:42:22,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:42:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-11-16 09:42:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192429370] [2024-11-16 09:42:22,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:42:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-16 09:42:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-16 09:42:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2024-11-16 09:42:22,712 INFO L87 Difference]: Start difference. First operand 6277 states and 8631 transitions. Second operand has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 26 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:23,357 INFO L93 Difference]: Finished difference Result 14502 states and 19401 transitions. [2024-11-16 09:42:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:42:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 26 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-16 09:42:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:23,366 INFO L225 Difference]: With dead ends: 14502 [2024-11-16 09:42:23,367 INFO L226 Difference]: Without dead ends: 10547 [2024-11-16 09:42:23,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 09:42:23,372 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 13815 mSDsluCounter, 6466 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13815 SdHoareTripleChecker+Valid, 7986 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:23,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13815 Valid, 7986 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 09:42:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10547 states. [2024-11-16 09:42:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10547 to 10437. [2024-11-16 09:42:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10437 states, 10435 states have (on average 1.3354096789650216) internal successors, (13935), 10436 states have internal predecessors, (13935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10437 states to 10437 states and 13935 transitions. [2024-11-16 09:42:23,614 INFO L78 Accepts]: Start accepts. Automaton has 10437 states and 13935 transitions. Word has length 93 [2024-11-16 09:42:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:23,614 INFO L471 AbstractCegarLoop]: Abstraction has 10437 states and 13935 transitions. [2024-11-16 09:42:23,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 26 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 10437 states and 13935 transitions. [2024-11-16 09:42:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 09:42:23,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:23,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:23,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 09:42:23,821 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,SelfDestructingSolverStorable23 [2024-11-16 09:42:23,822 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:23,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash -990916156, now seen corresponding path program 1 times [2024-11-16 09:42:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208928555] [2024-11-16 09:42:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208928555] [2024-11-16 09:42:24,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208928555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:42:24,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328962852] [2024-11-16 09:42:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:24,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:42:24,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:42:24,139 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-11-16 09:42:24,140 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-11-16 09:42:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:24,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 09:42:24,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:42:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:25,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:42:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:26,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328962852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:42:26,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:42:26,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2024-11-16 09:42:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873296501] [2024-11-16 09:42:26,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:42:26,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-16 09:42:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:26,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-16 09:42:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-11-16 09:42:26,552 INFO L87 Difference]: Start difference. First operand 10437 states and 13935 transitions. Second operand has 30 states, 30 states have (on average 8.466666666666667) internal successors, (254), 29 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:42:31,569 INFO L93 Difference]: Finished difference Result 61350 states and 79741 transitions. [2024-11-16 09:42:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-16 09:42:31,570 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.466666666666667) internal successors, (254), 29 states have internal predecessors, (254), 0 states have call successors, (0), 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 94 [2024-11-16 09:42:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:42:31,621 INFO L225 Difference]: With dead ends: 61350 [2024-11-16 09:42:31,621 INFO L226 Difference]: Without dead ends: 53235 [2024-11-16 09:42:31,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1586, Invalid=6424, Unknown=0, NotChecked=0, Total=8010 [2024-11-16 09:42:31,636 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 21228 mSDsluCounter, 10153 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21228 SdHoareTripleChecker+Valid, 11708 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 09:42:31,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21228 Valid, 11708 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 09:42:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53235 states. [2024-11-16 09:42:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53235 to 52789. [2024-11-16 09:42:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52789 states, 52787 states have (on average 1.2820391384242333) internal successors, (67675), 52788 states have internal predecessors, (67675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52789 states to 52789 states and 67675 transitions. [2024-11-16 09:42:33,019 INFO L78 Accepts]: Start accepts. Automaton has 52789 states and 67675 transitions. Word has length 94 [2024-11-16 09:42:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:42:33,019 INFO L471 AbstractCegarLoop]: Abstraction has 52789 states and 67675 transitions. [2024-11-16 09:42:33,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.466666666666667) internal successors, (254), 29 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:42:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52789 states and 67675 transitions. [2024-11-16 09:42:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:42:33,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:42:33,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:42:33,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 09:42:33,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:42:33,229 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:42:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:42:33,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1927534653, now seen corresponding path program 1 times [2024-11-16 09:42:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:42:33,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338676409] [2024-11-16 09:42:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:42:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:34,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:42:34,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338676409] [2024-11-16 09:42:34,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338676409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:42:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949610361] [2024-11-16 09:42:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:42:34,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:42:34,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:42:34,257 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-11-16 09:42:34,258 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-11-16 09:42:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:42:34,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-16 09:42:34,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:42:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:36,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:42:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:42:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949610361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:42:38,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:42:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 21] total 49 [2024-11-16 09:42:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716037447] [2024-11-16 09:42:38,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:42:38,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-16 09:42:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:42:38,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-16 09:42:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2147, Unknown=0, NotChecked=0, Total=2352 [2024-11-16 09:42:38,868 INFO L87 Difference]: Start difference. First operand 52789 states and 67675 transitions. Second operand has 49 states, 49 states have (on average 5.285714285714286) internal successors, (259), 49 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)