./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.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 86c00f883fa3e8faefbb452f43186512b5e61200a78dfa098cc8c12a3f17e307 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:25:18,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:25:18,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:25:18,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:25:18,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:25:18,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:25:18,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:25:18,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:25:18,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:25:18,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:25:18,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:25:18,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:25:18,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:25:18,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:25:18,113 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:25:18,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:25:18,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:25:18,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:25:18,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:25:18,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:25:18,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:25:18,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:25:18,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:25:18,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:25:18,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:25:18,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:25:18,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:25:18,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:25:18,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:25:18,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:25:18,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:25:18,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:25:18,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:25:18,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:25:18,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:25:18,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:25:18,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:25:18,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:25:18,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:25:18,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:25:18,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:25:18,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:25:18,120 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 -> 86c00f883fa3e8faefbb452f43186512b5e61200a78dfa098cc8c12a3f17e307 [2024-10-12 21:25:18,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:25:18,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:25:18,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:25:18,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:25:18,320 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:25:18,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c [2024-10-12 21:25:19,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:25:19,815 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:25:19,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c [2024-10-12 21:25:19,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b12fcf24/d4fe1d1b399646db890b4ec71cfe8090/FLAGcfd95c8c6 [2024-10-12 21:25:19,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b12fcf24/d4fe1d1b399646db890b4ec71cfe8090 [2024-10-12 21:25:19,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:25:19,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:25:19,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:25:19,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:25:19,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:25:19,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:25:19" (1/1) ... [2024-10-12 21:25:19,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202dfd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:19, skipping insertion in model container [2024-10-12 21:25:19,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:25:19" (1/1) ... [2024-10-12 21:25:19,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:25:20,196 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c[8616,8629] [2024-10-12 21:25:20,212 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c[10491,10504] [2024-10-12 21:25:20,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:25:20,687 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:25:20,713 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c[8616,8629] [2024-10-12 21:25:20,715 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c[10491,10504] [2024-10-12 21:25:21,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:25:21,059 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:25:21,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21 WrapperNode [2024-10-12 21:25:21,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:25:21,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:25:21,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:25:21,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:25:21,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,360 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5039 [2024-10-12 21:25:21,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:25:21,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:25:21,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:25:21,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:25:21,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,514 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:25:21,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:25:21,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:25:21,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:25:21,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:25:21,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (1/1) ... [2024-10-12 21:25:21,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:25:21,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:21,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:25:21,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:25:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:25:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:25:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:25:21,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:25:21,888 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:25:21,890 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:25:24,962 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2024-10-12 21:25:24,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:25:25,019 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:25:25,020 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:25:25,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:25:25 BoogieIcfgContainer [2024-10-12 21:25:25,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:25:25,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:25:25,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:25:25,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:25:25,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:25:19" (1/3) ... [2024-10-12 21:25:25,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6b23b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:25:25, skipping insertion in model container [2024-10-12 21:25:25,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:21" (2/3) ... [2024-10-12 21:25:25,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6b23b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:25:25, skipping insertion in model container [2024-10-12 21:25:25,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:25:25" (3/3) ... [2024-10-12 21:25:25,028 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label00.c [2024-10-12 21:25:25,040 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:25:25,040 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:25:25,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:25:25,116 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;@18387282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:25:25,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:25:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 817 states have (on average 1.97796817625459) internal successors, (1616), 819 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 21:25:25,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:25,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:25,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:25,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash 176669343, now seen corresponding path program 1 times [2024-10-12 21:25:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392749754] [2024-10-12 21:25:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392749754] [2024-10-12 21:25:25,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392749754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:25,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:25,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:25:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060559531] [2024-10-12 21:25:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:25,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:25:25,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:25,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:25:25,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:25:25,318 INFO L87 Difference]: Start difference. First operand has 820 states, 817 states have (on average 1.97796817625459) internal successors, (1616), 819 states have internal predecessors, (1616), 0 states have call successors, (0), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:25,398 INFO L93 Difference]: Finished difference Result 1613 states and 3180 transitions. [2024-10-12 21:25:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:25:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-12 21:25:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:25,414 INFO L225 Difference]: With dead ends: 1613 [2024-10-12 21:25:25,414 INFO L226 Difference]: Without dead ends: 816 [2024-10-12 21:25:25,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:25:25,423 INFO L432 NwaCegarLoop]: 1545 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:25,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1545 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-12 21:25:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2024-10-12 21:25:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.898034398034398) internal successors, (1545), 815 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1545 transitions. [2024-10-12 21:25:25,495 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1545 transitions. Word has length 15 [2024-10-12 21:25:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:25,496 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1545 transitions. [2024-10-12 21:25:25,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1545 transitions. [2024-10-12 21:25:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 21:25:25,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:25,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:25,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:25:25,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:25,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1865480346, now seen corresponding path program 1 times [2024-10-12 21:25:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075386933] [2024-10-12 21:25:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:25,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:25,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075386933] [2024-10-12 21:25:25,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075386933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:25,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:25,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:25:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217949237] [2024-10-12 21:25:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:25,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:25,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:25,610 INFO L87 Difference]: Start difference. First operand 816 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:28,230 INFO L93 Difference]: Finished difference Result 2320 states and 4418 transitions. [2024-10-12 21:25:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-12 21:25:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:28,237 INFO L225 Difference]: With dead ends: 2320 [2024-10-12 21:25:28,237 INFO L226 Difference]: Without dead ends: 1567 [2024-10-12 21:25:28,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:28,239 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 909 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:28,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 531 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:25:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-10-12 21:25:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2024-10-12 21:25:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1565 states have (on average 1.6434504792332267) internal successors, (2572), 1566 states have internal predecessors, (2572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2572 transitions. [2024-10-12 21:25:28,271 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2572 transitions. Word has length 15 [2024-10-12 21:25:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:28,272 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2572 transitions. [2024-10-12 21:25:28,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2572 transitions. [2024-10-12 21:25:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:25:28,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:28,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:28,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:25:28,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:28,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2100021147, now seen corresponding path program 1 times [2024-10-12 21:25:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115330645] [2024-10-12 21:25:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:28,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:28,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115330645] [2024-10-12 21:25:28,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115330645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:28,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:28,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:25:28,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522718991] [2024-10-12 21:25:28,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:28,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:25:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:28,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:25:28,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:25:28,383 INFO L87 Difference]: Start difference. First operand 1567 states and 2572 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:28,442 INFO L93 Difference]: Finished difference Result 1640 states and 2687 transitions. [2024-10-12 21:25:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:25:28,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 21:25:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:28,448 INFO L225 Difference]: With dead ends: 1640 [2024-10-12 21:25:28,448 INFO L226 Difference]: Without dead ends: 1602 [2024-10-12 21:25:28,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:25:28,450 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 55 mSDsluCounter, 3052 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:28,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4592 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-10-12 21:25:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1567. [2024-10-12 21:25:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1565 states have (on average 1.6287539936102235) internal successors, (2549), 1566 states have internal predecessors, (2549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2549 transitions. [2024-10-12 21:25:28,473 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2549 transitions. Word has length 19 [2024-10-12 21:25:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:28,475 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2549 transitions. [2024-10-12 21:25:28,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2549 transitions. [2024-10-12 21:25:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 21:25:28,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:28,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:28,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:25:28,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:28,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1286109718, now seen corresponding path program 1 times [2024-10-12 21:25:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277565014] [2024-10-12 21:25:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277565014] [2024-10-12 21:25:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277565014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:28,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:28,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575874340] [2024-10-12 21:25:28,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:28,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:28,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:28,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:28,585 INFO L87 Difference]: Start difference. First operand 1567 states and 2549 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:28,730 INFO L93 Difference]: Finished difference Result 1847 states and 2997 transitions. [2024-10-12 21:25:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:25:28,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-12 21:25:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:28,735 INFO L225 Difference]: With dead ends: 1847 [2024-10-12 21:25:28,736 INFO L226 Difference]: Without dead ends: 1812 [2024-10-12 21:25:28,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:25:28,737 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 6246 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6246 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:28,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6246 Valid, 2155 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:25:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-10-12 21:25:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1600. [2024-10-12 21:25:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1598 states have (on average 1.62828535669587) internal successors, (2602), 1599 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2602 transitions. [2024-10-12 21:25:28,758 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2602 transitions. Word has length 41 [2024-10-12 21:25:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:28,759 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2602 transitions. [2024-10-12 21:25:28,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2602 transitions. [2024-10-12 21:25:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 21:25:28,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:28,760 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] [2024-10-12 21:25:28,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:25:28,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:28,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1122752986, now seen corresponding path program 1 times [2024-10-12 21:25:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039536436] [2024-10-12 21:25:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:28,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:28,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039536436] [2024-10-12 21:25:28,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039536436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:28,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:28,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119597923] [2024-10-12 21:25:28,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:28,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:28,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:28,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:28,817 INFO L87 Difference]: Start difference. First operand 1600 states and 2602 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:28,844 INFO L93 Difference]: Finished difference Result 1725 states and 2801 transitions. [2024-10-12 21:25:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 21:25:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:28,849 INFO L225 Difference]: With dead ends: 1725 [2024-10-12 21:25:28,849 INFO L226 Difference]: Without dead ends: 1657 [2024-10-12 21:25:28,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:28,850 INFO L432 NwaCegarLoop]: 1517 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:28,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1567 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-10-12 21:25:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1655. [2024-10-12 21:25:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1653 states have (on average 1.6261343012704175) internal successors, (2688), 1654 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2688 transitions. [2024-10-12 21:25:28,923 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2688 transitions. Word has length 43 [2024-10-12 21:25:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:28,924 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2688 transitions. [2024-10-12 21:25:28,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2688 transitions. [2024-10-12 21:25:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 21:25:28,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:28,928 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] [2024-10-12 21:25:28,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:25:28,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:28,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1120608034, now seen corresponding path program 1 times [2024-10-12 21:25:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:28,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521737079] [2024-10-12 21:25:28,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:29,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521737079] [2024-10-12 21:25:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521737079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:29,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:29,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:29,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133949493] [2024-10-12 21:25:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:29,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:29,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:29,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:29,100 INFO L87 Difference]: Start difference. First operand 1655 states and 2688 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:29,190 INFO L93 Difference]: Finished difference Result 1780 states and 2884 transitions. [2024-10-12 21:25:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:25:29,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 21:25:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:29,194 INFO L225 Difference]: With dead ends: 1780 [2024-10-12 21:25:29,194 INFO L226 Difference]: Without dead ends: 1657 [2024-10-12 21:25:29,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:25:29,195 INFO L432 NwaCegarLoop]: 1513 mSDtfsCounter, 2964 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:29,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 1669 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-10-12 21:25:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1655. [2024-10-12 21:25:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1653 states have (on average 1.6249243799153055) internal successors, (2686), 1654 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2686 transitions. [2024-10-12 21:25:29,215 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2686 transitions. Word has length 43 [2024-10-12 21:25:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:29,215 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2686 transitions. [2024-10-12 21:25:29,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2686 transitions. [2024-10-12 21:25:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 21:25:29,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:29,216 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] [2024-10-12 21:25:29,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:25:29,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:29,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash -507494279, now seen corresponding path program 1 times [2024-10-12 21:25:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:29,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742111533] [2024-10-12 21:25:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:29,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742111533] [2024-10-12 21:25:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742111533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:25:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087529837] [2024-10-12 21:25:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:29,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:25:29,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:25:29,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:25:29,301 INFO L87 Difference]: Start difference. First operand 1655 states and 2686 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:29,332 INFO L93 Difference]: Finished difference Result 1661 states and 2693 transitions. [2024-10-12 21:25:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:25:29,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-12 21:25:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:29,336 INFO L225 Difference]: With dead ends: 1661 [2024-10-12 21:25:29,337 INFO L226 Difference]: Without dead ends: 1659 [2024-10-12 21:25:29,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:25:29,338 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 0 mSDsluCounter, 3028 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:29,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-10-12 21:25:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1659. [2024-10-12 21:25:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1657 states have (on average 1.6228123114061557) internal successors, (2689), 1658 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2689 transitions. [2024-10-12 21:25:29,364 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2689 transitions. Word has length 44 [2024-10-12 21:25:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:29,365 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2689 transitions. [2024-10-12 21:25:29,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2689 transitions. [2024-10-12 21:25:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:29,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:29,367 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] [2024-10-12 21:25:29,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:25:29,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash 106173278, now seen corresponding path program 1 times [2024-10-12 21:25:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353552212] [2024-10-12 21:25:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:29,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353552212] [2024-10-12 21:25:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353552212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788723386] [2024-10-12 21:25:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:29,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:29,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,445 INFO L87 Difference]: Start difference. First operand 1659 states and 2689 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:29,469 INFO L93 Difference]: Finished difference Result 1797 states and 2902 transitions. [2024-10-12 21:25:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 21:25:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:29,474 INFO L225 Difference]: With dead ends: 1797 [2024-10-12 21:25:29,474 INFO L226 Difference]: Without dead ends: 1725 [2024-10-12 21:25:29,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,475 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 1484 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:29,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1615 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2024-10-12 21:25:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1723. [2024-10-12 21:25:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1721 states have (on average 1.6188262638001163) internal successors, (2786), 1722 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2786 transitions. [2024-10-12 21:25:29,498 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2786 transitions. Word has length 45 [2024-10-12 21:25:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:29,499 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2786 transitions. [2024-10-12 21:25:29,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2786 transitions. [2024-10-12 21:25:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:29,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:29,499 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] [2024-10-12 21:25:29,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:25:29,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:29,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash -479538850, now seen corresponding path program 1 times [2024-10-12 21:25:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115528236] [2024-10-12 21:25:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:29,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115528236] [2024-10-12 21:25:29,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115528236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:29,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:29,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697702751] [2024-10-12 21:25:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:29,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:29,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:29,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:29,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,540 INFO L87 Difference]: Start difference. First operand 1723 states and 2786 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:29,565 INFO L93 Difference]: Finished difference Result 2077 states and 3326 transitions. [2024-10-12 21:25:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 21:25:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:29,571 INFO L225 Difference]: With dead ends: 2077 [2024-10-12 21:25:29,571 INFO L226 Difference]: Without dead ends: 1888 [2024-10-12 21:25:29,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,574 INFO L432 NwaCegarLoop]: 1551 mSDtfsCounter, 1480 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:29,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1615 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2024-10-12 21:25:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1886. [2024-10-12 21:25:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1884 states have (on average 1.6072186836518048) internal successors, (3028), 1885 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3028 transitions. [2024-10-12 21:25:29,600 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3028 transitions. Word has length 45 [2024-10-12 21:25:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:29,600 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 3028 transitions. [2024-10-12 21:25:29,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3028 transitions. [2024-10-12 21:25:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:29,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:29,601 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] [2024-10-12 21:25:29,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:25:29,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 409194590, now seen corresponding path program 1 times [2024-10-12 21:25:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994899049] [2024-10-12 21:25:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:29,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994899049] [2024-10-12 21:25:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994899049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:29,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254395358] [2024-10-12 21:25:29,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:29,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,647 INFO L87 Difference]: Start difference. First operand 1886 states and 3028 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:29,675 INFO L93 Difference]: Finished difference Result 2542 states and 4010 transitions. [2024-10-12 21:25:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 21:25:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:29,681 INFO L225 Difference]: With dead ends: 2542 [2024-10-12 21:25:29,681 INFO L226 Difference]: Without dead ends: 2190 [2024-10-12 21:25:29,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,682 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 1478 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:29,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1617 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2024-10-12 21:25:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2188. [2024-10-12 21:25:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 2186 states have (on average 1.584629460201281) internal successors, (3464), 2187 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3464 transitions. [2024-10-12 21:25:29,716 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3464 transitions. Word has length 45 [2024-10-12 21:25:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:29,716 INFO L471 AbstractCegarLoop]: Abstraction has 2188 states and 3464 transitions. [2024-10-12 21:25:29,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3464 transitions. [2024-10-12 21:25:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:29,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:29,717 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] [2024-10-12 21:25:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:25:29,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:29,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash 146117214, now seen corresponding path program 1 times [2024-10-12 21:25:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:29,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029449532] [2024-10-12 21:25:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029449532] [2024-10-12 21:25:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029449532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:29,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:29,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719434683] [2024-10-12 21:25:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:29,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,771 INFO L87 Difference]: Start difference. First operand 2188 states and 3464 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:29,805 INFO L93 Difference]: Finished difference Result 3400 states and 5234 transitions. [2024-10-12 21:25:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:29,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 21:25:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:29,812 INFO L225 Difference]: With dead ends: 3400 [2024-10-12 21:25:29,812 INFO L226 Difference]: Without dead ends: 2746 [2024-10-12 21:25:29,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:29,814 INFO L432 NwaCegarLoop]: 1561 mSDtfsCounter, 1482 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:29,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1621 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2024-10-12 21:25:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2744. [2024-10-12 21:25:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2744 states, 2742 states have (on average 1.5463165572574762) internal successors, (4240), 2743 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 4240 transitions. [2024-10-12 21:25:29,893 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 4240 transitions. Word has length 45 [2024-10-12 21:25:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:29,893 INFO L471 AbstractCegarLoop]: Abstraction has 2744 states and 4240 transitions. [2024-10-12 21:25:29,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 4240 transitions. [2024-10-12 21:25:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:25:29,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:29,895 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] [2024-10-12 21:25:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:25:29,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash -879880138, now seen corresponding path program 1 times [2024-10-12 21:25:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257002174] [2024-10-12 21:25:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:25:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:30,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257002174] [2024-10-12 21:25:30,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257002174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:30,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:30,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790284647] [2024-10-12 21:25:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:30,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:30,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:30,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:30,006 INFO L87 Difference]: Start difference. First operand 2744 states and 4240 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-10-12 21:25:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:30,181 INFO L93 Difference]: Finished difference Result 7506 states and 11101 transitions. [2024-10-12 21:25:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:25:30,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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 61 [2024-10-12 21:25:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:30,198 INFO L225 Difference]: With dead ends: 7506 [2024-10-12 21:25:30,199 INFO L226 Difference]: Without dead ends: 6640 [2024-10-12 21:25:30,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:25:30,202 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4637 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 3284 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:30,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 3284 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2024-10-12 21:25:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 3784. [2024-10-12 21:25:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 3782 states have (on average 1.5124272871496562) internal successors, (5720), 3783 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5720 transitions. [2024-10-12 21:25:30,317 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5720 transitions. Word has length 61 [2024-10-12 21:25:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:30,317 INFO L471 AbstractCegarLoop]: Abstraction has 3784 states and 5720 transitions. [2024-10-12 21:25:30,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-10-12 21:25:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5720 transitions. [2024-10-12 21:25:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:25:30,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:30,318 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] [2024-10-12 21:25:30,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:25:30,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1465592266, now seen corresponding path program 1 times [2024-10-12 21:25:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360545369] [2024-10-12 21:25:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:25:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360545369] [2024-10-12 21:25:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360545369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262236193] [2024-10-12 21:25:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:30,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:30,441 INFO L87 Difference]: Start difference. First operand 3784 states and 5720 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-10-12 21:25:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:30,606 INFO L93 Difference]: Finished difference Result 8714 states and 12829 transitions. [2024-10-12 21:25:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:25:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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 61 [2024-10-12 21:25:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:30,618 INFO L225 Difference]: With dead ends: 8714 [2024-10-12 21:25:30,618 INFO L226 Difference]: Without dead ends: 7504 [2024-10-12 21:25:30,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:25:30,622 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4672 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:30,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 3304 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2024-10-12 21:25:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 5424. [2024-10-12 21:25:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5424 states, 5422 states have (on average 1.484323127997049) internal successors, (8048), 5423 states have internal predecessors, (8048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 8048 transitions. [2024-10-12 21:25:30,726 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 8048 transitions. Word has length 61 [2024-10-12 21:25:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:30,726 INFO L471 AbstractCegarLoop]: Abstraction has 5424 states and 8048 transitions. [2024-10-12 21:25:30,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-10-12 21:25:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 8048 transitions. [2024-10-12 21:25:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:25:30,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:30,727 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] [2024-10-12 21:25:30,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:25:30,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:30,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash -576858826, now seen corresponding path program 1 times [2024-10-12 21:25:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915213539] [2024-10-12 21:25:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 21:25:30,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915213539] [2024-10-12 21:25:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915213539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:30,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95123616] [2024-10-12 21:25:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:30,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:30,812 INFO L87 Difference]: Start difference. First operand 5424 states and 8048 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:31,016 INFO L93 Difference]: Finished difference Result 9922 states and 14549 transitions. [2024-10-12 21:25:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:25:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 61 [2024-10-12 21:25:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:31,026 INFO L225 Difference]: With dead ends: 9922 [2024-10-12 21:25:31,026 INFO L226 Difference]: Without dead ends: 8712 [2024-10-12 21:25:31,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:25:31,028 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4667 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:31,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3318 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:25:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2024-10-12 21:25:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 6632. [2024-10-12 21:25:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6632 states, 6630 states have (on average 1.4733031674208146) internal successors, (9768), 6631 states have internal predecessors, (9768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 9768 transitions. [2024-10-12 21:25:31,137 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 9768 transitions. Word has length 61 [2024-10-12 21:25:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:31,137 INFO L471 AbstractCegarLoop]: Abstraction has 6632 states and 9768 transitions. [2024-10-12 21:25:31,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 9768 transitions. [2024-10-12 21:25:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:25:31,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:31,138 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] [2024-10-12 21:25:31,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:25:31,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:31,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash -839936202, now seen corresponding path program 1 times [2024-10-12 21:25:31,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:31,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36790112] [2024-10-12 21:25:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:31,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:25:31,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:31,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36790112] [2024-10-12 21:25:31,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36790112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:31,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:31,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99795497] [2024-10-12 21:25:31,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:31,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:31,219 INFO L87 Difference]: Start difference. First operand 6632 states and 9768 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-12 21:25:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:31,400 INFO L93 Difference]: Finished difference Result 11130 states and 16269 transitions. [2024-10-12 21:25:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:25:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 61 [2024-10-12 21:25:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:31,412 INFO L225 Difference]: With dead ends: 11130 [2024-10-12 21:25:31,413 INFO L226 Difference]: Without dead ends: 9920 [2024-10-12 21:25:31,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:25:31,416 INFO L432 NwaCegarLoop]: 1565 mSDtfsCounter, 4637 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:31,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 3350 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:25:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9920 states. [2024-10-12 21:25:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9920 to 7840. [2024-10-12 21:25:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7840 states, 7838 states have (on average 1.4656800204133709) internal successors, (11488), 7839 states have internal predecessors, (11488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7840 states to 7840 states and 11488 transitions. [2024-10-12 21:25:31,555 INFO L78 Accepts]: Start accepts. Automaton has 7840 states and 11488 transitions. Word has length 61 [2024-10-12 21:25:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:31,556 INFO L471 AbstractCegarLoop]: Abstraction has 7840 states and 11488 transitions. [2024-10-12 21:25:31,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-12 21:25:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 7840 states and 11488 transitions. [2024-10-12 21:25:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 21:25:31,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:31,557 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] [2024-10-12 21:25:31,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:25:31,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:31,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash -593577456, now seen corresponding path program 1 times [2024-10-12 21:25:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:31,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988195543] [2024-10-12 21:25:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:31,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:31,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988195543] [2024-10-12 21:25:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988195543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:31,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:31,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:31,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712339156] [2024-10-12 21:25:31,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:31,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:31,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:31,616 INFO L87 Difference]: Start difference. First operand 7840 states and 11488 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-10-12 21:25:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:31,758 INFO L93 Difference]: Finished difference Result 14148 states and 20482 transitions. [2024-10-12 21:25:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:31,759 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-10-12 21:25:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:31,767 INFO L225 Difference]: With dead ends: 14148 [2024-10-12 21:25:31,767 INFO L226 Difference]: Without dead ends: 7842 [2024-10-12 21:25:31,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:31,771 INFO L432 NwaCegarLoop]: 1545 mSDtfsCounter, 37 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:31,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3053 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7842 states. [2024-10-12 21:25:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7842 to 7840. [2024-10-12 21:25:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7840 states, 7838 states have (on average 1.44985965807604) internal successors, (11364), 7839 states have internal predecessors, (11364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7840 states to 7840 states and 11364 transitions. [2024-10-12 21:25:31,893 INFO L78 Accepts]: Start accepts. Automaton has 7840 states and 11364 transitions. Word has length 62 [2024-10-12 21:25:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:31,894 INFO L471 AbstractCegarLoop]: Abstraction has 7840 states and 11364 transitions. [2024-10-12 21:25:31,894 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-10-12 21:25:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7840 states and 11364 transitions. [2024-10-12 21:25:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 21:25:31,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:31,895 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] [2024-10-12 21:25:31,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:25:31,895 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:31,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 153695742, now seen corresponding path program 1 times [2024-10-12 21:25:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264972942] [2024-10-12 21:25:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:31,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264972942] [2024-10-12 21:25:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264972942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:31,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533361749] [2024-10-12 21:25:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:31,957 INFO L87 Difference]: Start difference. First operand 7840 states and 11364 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:32,009 INFO L93 Difference]: Finished difference Result 10236 states and 14771 transitions. [2024-10-12 21:25:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:32,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-12 21:25:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:32,014 INFO L225 Difference]: With dead ends: 10236 [2024-10-12 21:25:32,014 INFO L226 Difference]: Without dead ends: 3930 [2024-10-12 21:25:32,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:32,019 INFO L432 NwaCegarLoop]: 1543 mSDtfsCounter, 31 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:32,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3050 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2024-10-12 21:25:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3923. [2024-10-12 21:25:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3921 states have (on average 1.4922213720989543) internal successors, (5851), 3922 states have internal predecessors, (5851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5851 transitions. [2024-10-12 21:25:32,069 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5851 transitions. Word has length 63 [2024-10-12 21:25:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:32,069 INFO L471 AbstractCegarLoop]: Abstraction has 3923 states and 5851 transitions. [2024-10-12 21:25:32,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5851 transitions. [2024-10-12 21:25:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 21:25:32,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:32,070 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] [2024-10-12 21:25:32,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:25:32,071 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:32,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1807172254, now seen corresponding path program 1 times [2024-10-12 21:25:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:32,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974069046] [2024-10-12 21:25:32,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:32,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:32,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974069046] [2024-10-12 21:25:32,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974069046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:32,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:32,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077051700] [2024-10-12 21:25:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:32,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:32,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:32,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:32,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:32,126 INFO L87 Difference]: Start difference. First operand 3923 states and 5851 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:32,158 INFO L93 Difference]: Finished difference Result 5115 states and 7525 transitions. [2024-10-12 21:25:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 21:25:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:32,163 INFO L225 Difference]: With dead ends: 5115 [2024-10-12 21:25:32,163 INFO L226 Difference]: Without dead ends: 2737 [2024-10-12 21:25:32,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:32,165 INFO L432 NwaCegarLoop]: 1537 mSDtfsCounter, 33 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:32,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3029 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2024-10-12 21:25:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2735. [2024-10-12 21:25:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2733 states have (on average 1.5210391511159898) internal successors, (4157), 2734 states have internal predecessors, (4157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4157 transitions. [2024-10-12 21:25:32,196 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4157 transitions. Word has length 64 [2024-10-12 21:25:32,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:32,196 INFO L471 AbstractCegarLoop]: Abstraction has 2735 states and 4157 transitions. [2024-10-12 21:25:32,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4157 transitions. [2024-10-12 21:25:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:25:32,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:32,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:32,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:25:32,197 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:32,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1518156628, now seen corresponding path program 1 times [2024-10-12 21:25:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723085642] [2024-10-12 21:25:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:32,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723085642] [2024-10-12 21:25:32,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723085642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:32,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:32,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:32,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134800829] [2024-10-12 21:25:32,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:32,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:32,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:32,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:32,262 INFO L87 Difference]: Start difference. First operand 2735 states and 4157 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:32,286 INFO L93 Difference]: Finished difference Result 3333 states and 4984 transitions. [2024-10-12 21:25:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-12 21:25:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:32,289 INFO L225 Difference]: With dead ends: 3333 [2024-10-12 21:25:32,289 INFO L226 Difference]: Without dead ends: 2143 [2024-10-12 21:25:32,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:32,291 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 30 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:32,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3014 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2024-10-12 21:25:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2141. [2024-10-12 21:25:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 2139 states have (on average 1.5525946704067322) internal successors, (3321), 2140 states have internal predecessors, (3321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3321 transitions. [2024-10-12 21:25:32,314 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3321 transitions. Word has length 66 [2024-10-12 21:25:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:32,314 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 3321 transitions. [2024-10-12 21:25:32,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3321 transitions. [2024-10-12 21:25:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 21:25:32,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:32,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:32,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:25:32,315 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:32,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 312352826, now seen corresponding path program 1 times [2024-10-12 21:25:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444239103] [2024-10-12 21:25:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:25:32,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444239103] [2024-10-12 21:25:32,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444239103] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:25:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398463915] [2024-10-12 21:25:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:32,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:32,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:25:32,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:25:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:32,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 21:25:32,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:25:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:25:32,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:25:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:25:32,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398463915] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:25:32,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:25:32,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2024-10-12 21:25:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892426131] [2024-10-12 21:25:32,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:25:32,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:25:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:32,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:25:32,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:25:32,928 INFO L87 Difference]: Start difference. First operand 2141 states and 3321 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:33,010 INFO L93 Difference]: Finished difference Result 3569 states and 5231 transitions. [2024-10-12 21:25:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:25:33,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 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 68 [2024-10-12 21:25:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:33,014 INFO L225 Difference]: With dead ends: 3569 [2024-10-12 21:25:33,014 INFO L226 Difference]: Without dead ends: 2973 [2024-10-12 21:25:33,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:25:33,015 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 2981 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2981 SdHoareTripleChecker+Valid, 3234 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:33,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2981 Valid, 3234 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:25:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2024-10-12 21:25:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2916. [2024-10-12 21:25:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2914 states have (on average 1.473232669869595) internal successors, (4293), 2915 states have internal predecessors, (4293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4293 transitions. [2024-10-12 21:25:33,052 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4293 transitions. Word has length 68 [2024-10-12 21:25:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:33,052 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4293 transitions. [2024-10-12 21:25:33,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4293 transitions. [2024-10-12 21:25:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:25:33,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:33,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:33,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:25:33,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:33,258 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:33,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 424413204, now seen corresponding path program 1 times [2024-10-12 21:25:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080797754] [2024-10-12 21:25:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:34,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080797754] [2024-10-12 21:25:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080797754] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:25:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123893180] [2024-10-12 21:25:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:34,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:25:34,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:25:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:34,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 21:25:34,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:25:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:35,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:25:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123893180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:25:36,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:25:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 34 [2024-10-12 21:25:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460415262] [2024-10-12 21:25:36,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:25:36,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-12 21:25:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:36,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-12 21:25:36,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 21:25:36,332 INFO L87 Difference]: Start difference. First operand 2916 states and 4293 transitions. Second operand has 34 states, 34 states have (on average 5.264705882352941) internal successors, (179), 34 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:37,787 INFO L93 Difference]: Finished difference Result 6744 states and 9313 transitions. [2024-10-12 21:25:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-12 21:25:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.264705882352941) internal successors, (179), 34 states have internal predecessors, (179), 0 states have call successors, (0), 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 69 [2024-10-12 21:25:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:37,795 INFO L225 Difference]: With dead ends: 6744 [2024-10-12 21:25:37,796 INFO L226 Difference]: Without dead ends: 5500 [2024-10-12 21:25:37,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=938, Invalid=3222, Unknown=0, NotChecked=0, Total=4160 [2024-10-12 21:25:37,799 INFO L432 NwaCegarLoop]: 1492 mSDtfsCounter, 13121 mSDsluCounter, 7901 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13121 SdHoareTripleChecker+Valid, 9393 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:37,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13121 Valid, 9393 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:25:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5500 states. [2024-10-12 21:25:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5500 to 5364. [2024-10-12 21:25:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5364 states, 5362 states have (on average 1.386609474076837) internal successors, (7435), 5363 states have internal predecessors, (7435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 7435 transitions. [2024-10-12 21:25:37,891 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 7435 transitions. Word has length 69 [2024-10-12 21:25:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:37,891 INFO L471 AbstractCegarLoop]: Abstraction has 5364 states and 7435 transitions. [2024-10-12 21:25:37,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.264705882352941) internal successors, (179), 34 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 7435 transitions. [2024-10-12 21:25:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:25:37,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:37,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:37,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:25:38,093 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,SelfDestructingSolverStorable20 [2024-10-12 21:25:38,093 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:38,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1130703970, now seen corresponding path program 1 times [2024-10-12 21:25:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12647450] [2024-10-12 21:25:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:39,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12647450] [2024-10-12 21:25:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12647450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:25:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937007560] [2024-10-12 21:25:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:39,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:25:39,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:25:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:39,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 21:25:39,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:25:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:39,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:25:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937007560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:25:40,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:25:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-12 21:25:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803112041] [2024-10-12 21:25:40,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:25:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 21:25:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 21:25:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2024-10-12 21:25:40,345 INFO L87 Difference]: Start difference. First operand 5364 states and 7435 transitions. Second operand has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 27 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:41,801 INFO L93 Difference]: Finished difference Result 19941 states and 26215 transitions. [2024-10-12 21:25:41,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-12 21:25:41,802 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 27 states have internal predecessors, (178), 0 states have call successors, (0), 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 69 [2024-10-12 21:25:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:41,821 INFO L225 Difference]: With dead ends: 19941 [2024-10-12 21:25:41,821 INFO L226 Difference]: Without dead ends: 16292 [2024-10-12 21:25:41,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=627, Invalid=2453, Unknown=0, NotChecked=0, Total=3080 [2024-10-12 21:25:41,828 INFO L432 NwaCegarLoop]: 1495 mSDtfsCounter, 15493 mSDsluCounter, 5022 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15493 SdHoareTripleChecker+Valid, 6517 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:41,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15493 Valid, 6517 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:25:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16292 states. [2024-10-12 21:25:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16292 to 16158. [2024-10-12 21:25:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16158 states, 16156 states have (on average 1.3094206486754147) internal successors, (21155), 16157 states have internal predecessors, (21155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16158 states to 16158 states and 21155 transitions. [2024-10-12 21:25:42,205 INFO L78 Accepts]: Start accepts. Automaton has 16158 states and 21155 transitions. Word has length 69 [2024-10-12 21:25:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:42,205 INFO L471 AbstractCegarLoop]: Abstraction has 16158 states and 21155 transitions. [2024-10-12 21:25:42,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 27 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 16158 states and 21155 transitions. [2024-10-12 21:25:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:25:42,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:42,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:42,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:25:42,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:42,411 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:42,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 103866210, now seen corresponding path program 1 times [2024-10-12 21:25:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620507301] [2024-10-12 21:25:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:43,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620507301] [2024-10-12 21:25:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620507301] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:25:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896517371] [2024-10-12 21:25:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:43,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:25:43,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:25:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:43,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 21:25:43,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:25:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:43,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:25:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:43,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896517371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:25:43,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:25:43,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-10-12 21:25:43,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946214637] [2024-10-12 21:25:43,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:25:43,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 21:25:43,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:43,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 21:25:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2024-10-12 21:25:43,762 INFO L87 Difference]: Start difference. First operand 16158 states and 21155 transitions. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 27 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:45,165 INFO L93 Difference]: Finished difference Result 45509 states and 58902 transitions. [2024-10-12 21:25:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-12 21:25:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 27 states have internal predecessors, (185), 0 states have call successors, (0), 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 69 [2024-10-12 21:25:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:45,202 INFO L225 Difference]: With dead ends: 45509 [2024-10-12 21:25:45,202 INFO L226 Difference]: Without dead ends: 33020 [2024-10-12 21:25:45,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=714, Invalid=2708, Unknown=0, NotChecked=0, Total=3422 [2024-10-12 21:25:45,217 INFO L432 NwaCegarLoop]: 1519 mSDtfsCounter, 21373 mSDsluCounter, 6342 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21373 SdHoareTripleChecker+Valid, 7861 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:45,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21373 Valid, 7861 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:25:45,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33020 states. [2024-10-12 21:25:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33020 to 31484. [2024-10-12 21:25:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31484 states, 31482 states have (on average 1.277682485229655) internal successors, (40224), 31483 states have internal predecessors, (40224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31484 states to 31484 states and 40224 transitions. [2024-10-12 21:25:45,981 INFO L78 Accepts]: Start accepts. Automaton has 31484 states and 40224 transitions. Word has length 69 [2024-10-12 21:25:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:45,981 INFO L471 AbstractCegarLoop]: Abstraction has 31484 states and 40224 transitions. [2024-10-12 21:25:45,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 27 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31484 states and 40224 transitions. [2024-10-12 21:25:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 21:25:45,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:45,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:45,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:25:46,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:46,184 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1994982376, now seen corresponding path program 1 times [2024-10-12 21:25:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531174031] [2024-10-12 21:25:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531174031] [2024-10-12 21:25:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531174031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:25:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579229491] [2024-10-12 21:25:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:46,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:46,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:46,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:25:46,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 21:25:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:46,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 21:25:46,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:25:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:46,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:25:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:47,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579229491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:25:47,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:25:47,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-10-12 21:25:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373728631] [2024-10-12 21:25:47,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:25:47,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 21:25:47,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 21:25:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2024-10-12 21:25:47,799 INFO L87 Difference]: Start difference. First operand 31484 states and 40224 transitions. Second operand has 30 states, 30 states have (on average 6.466666666666667) internal successors, (194), 30 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:48,869 INFO L93 Difference]: Finished difference Result 57818 states and 73629 transitions. [2024-10-12 21:25:48,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 21:25:48,874 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.466666666666667) internal successors, (194), 30 states have internal predecessors, (194), 0 states have call successors, (0), 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 70 [2024-10-12 21:25:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:48,920 INFO L225 Difference]: With dead ends: 57818 [2024-10-12 21:25:48,921 INFO L226 Difference]: Without dead ends: 32868 [2024-10-12 21:25:48,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=470, Invalid=1422, Unknown=0, NotChecked=0, Total=1892 [2024-10-12 21:25:48,947 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 20763 mSDsluCounter, 7691 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20763 SdHoareTripleChecker+Valid, 9189 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:48,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20763 Valid, 9189 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:25:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32868 states. [2024-10-12 21:25:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32868 to 29770. [2024-10-12 21:25:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29770 states, 29768 states have (on average 1.2660911045417897) internal successors, (37689), 29769 states have internal predecessors, (37689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29770 states to 29770 states and 37689 transitions. [2024-10-12 21:25:49,706 INFO L78 Accepts]: Start accepts. Automaton has 29770 states and 37689 transitions. Word has length 70 [2024-10-12 21:25:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:49,706 INFO L471 AbstractCegarLoop]: Abstraction has 29770 states and 37689 transitions. [2024-10-12 21:25:49,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.466666666666667) internal successors, (194), 30 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:25:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 29770 states and 37689 transitions. [2024-10-12 21:25:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 21:25:49,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:49,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:49,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 21:25:49,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-12 21:25:49,909 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:49,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1693442382, now seen corresponding path program 1 times [2024-10-12 21:25:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:49,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051148416] [2024-10-12 21:25:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051148416] [2024-10-12 21:25:50,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051148416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:25:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416609633] [2024-10-12 21:25:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:25:50,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:50,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:25:50,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 21:25:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:50,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-12 21:25:50,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:25:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:53,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:25:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:25:57,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416609633] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:25:57,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:25:57,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 27] total 62 [2024-10-12 21:25:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747009870] [2024-10-12 21:25:57,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:25:57,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-12 21:25:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:57,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-12 21:25:57,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=3231, Unknown=0, NotChecked=0, Total=3782 [2024-10-12 21:25:57,868 INFO L87 Difference]: Start difference. First operand 29770 states and 37689 transitions. Second operand has 62 states, 62 states have (on average 3.129032258064516) internal successors, (194), 62 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)