./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_label04.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_label04.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 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:25:43,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:25:43,826 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:43,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:25:43,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:25:43,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:25:43,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:25:43,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:25:43,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:25:43,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:25:43,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:25:43,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:25:43,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:25:43,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:25:43,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:25:43,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:25:43,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:25:43,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:25:43,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:25:43,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:25:43,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:25:43,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:25:43,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:25:43,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:25:43,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:25:43,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:25:43,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:25:43,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:25:43,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:25:43,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:25:43,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:25:43,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:25:43,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:25:43,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:25:43,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:25:43,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:25:43,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:25:43,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:25:43,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:25:43,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:25:43,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:25:43,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:25:43,886 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 -> 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 [2024-10-12 21:25:44,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:25:44,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:25:44,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:25:44,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:25:44,180 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:25:44,181 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_label04.c [2024-10-12 21:25:45,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:25:46,069 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:25:46,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2024-10-12 21:25:46,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2898f83c0/3e8d1beba5de49d39385eadb9531bc7b/FLAGac1e162a5 [2024-10-12 21:25:46,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2898f83c0/3e8d1beba5de49d39385eadb9531bc7b [2024-10-12 21:25:46,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:25:46,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:25:46,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:25:46,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:25:46,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:25:46,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:25:46" (1/1) ... [2024-10-12 21:25:46,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b448d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:46, skipping insertion in model container [2024-10-12 21:25:46,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:25:46" (1/1) ... [2024-10-12 21:25:46,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:25:46,534 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_label04.c[8616,8629] [2024-10-12 21:25:46,592 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_label04.c[15677,15690] [2024-10-12 21:25:47,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:25:47,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:25:47,297 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_label04.c[8616,8629] [2024-10-12 21:25:47,306 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_label04.c[15677,15690] [2024-10-12 21:25:47,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:25:47,743 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:25:47,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:47 WrapperNode [2024-10-12 21:25:47,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:25:47,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:25:47,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:25:47,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:25:47,752 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:47" (1/1) ... [2024-10-12 21:25:47,810 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:47" (1/1) ... [2024-10-12 21:25:48,055 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5039 [2024-10-12 21:25:48,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:25:48,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:25:48,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:25:48,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:25:48,067 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:47" (1/1) ... [2024-10-12 21:25:48,068 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:47" (1/1) ... [2024-10-12 21:25:48,201 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:47" (1/1) ... [2024-10-12 21:25:48,282 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:48,282 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:47" (1/1) ... [2024-10-12 21:25:48,282 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:47" (1/1) ... [2024-10-12 21:25:48,478 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:47" (1/1) ... [2024-10-12 21:25:48,503 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:47" (1/1) ... [2024-10-12 21:25:48,528 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:47" (1/1) ... [2024-10-12 21:25:48,547 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:47" (1/1) ... [2024-10-12 21:25:48,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:25:48,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:25:48,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:25:48,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:25:48,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:47" (1/1) ... [2024-10-12 21:25:48,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:25:48,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:48,629 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:48,632 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:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:25:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:25:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:25:48,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:25:48,789 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:25:48,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:25:52,993 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2024-10-12 21:25:52,994 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:25:53,065 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:25:53,065 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:25:53,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:25:53 BoogieIcfgContainer [2024-10-12 21:25:53,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:25:53,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:25:53,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:25:53,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:25:53,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:25:46" (1/3) ... [2024-10-12 21:25:53,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef21187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:25:53, skipping insertion in model container [2024-10-12 21:25:53,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:47" (2/3) ... [2024-10-12 21:25:53,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef21187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:25:53, skipping insertion in model container [2024-10-12 21:25:53,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:25:53" (3/3) ... [2024-10-12 21:25:53,075 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2024-10-12 21:25:53,091 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:25:53,092 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:25:53,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:25:53,195 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;@19e22565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:25:53,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:25:53,206 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:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:25:53,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:53,213 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:53,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:53,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash -404549255, now seen corresponding path program 1 times [2024-10-12 21:25:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:53,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066241439] [2024-10-12 21:25:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:53,450 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:53,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066241439] [2024-10-12 21:25:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066241439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:25:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250004039] [2024-10-12 21:25:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:25:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:53,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:25:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:25:53,488 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 9.5) internal successors, (19), 2 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:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:53,591 INFO L93 Difference]: Finished difference Result 1613 states and 3180 transitions. [2024-10-12 21:25:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:25:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:53,618 INFO L225 Difference]: With dead ends: 1613 [2024-10-12 21:25:53,619 INFO L226 Difference]: Without dead ends: 816 [2024-10-12 21:25:53,628 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:53,633 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:53,635 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:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-12 21:25:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2024-10-12 21:25:53,728 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:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1545 transitions. [2024-10-12 21:25:53,733 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1545 transitions. Word has length 19 [2024-10-12 21:25:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:53,733 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1545 transitions. [2024-10-12 21:25:53,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1545 transitions. [2024-10-12 21:25:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:25:53,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:53,736 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:53,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:25:53,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:53,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:53,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1684412933, now seen corresponding path program 1 times [2024-10-12 21:25:53,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:53,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646948170] [2024-10-12 21:25:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:53,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:53,942 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:53,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:53,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646948170] [2024-10-12 21:25:53,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646948170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:53,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:53,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:25:53,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952318009] [2024-10-12 21:25:53,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:53,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:25:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:53,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:25:53,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:25:53,946 INFO L87 Difference]: Start difference. First operand 816 states and 1545 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:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:54,037 INFO L93 Difference]: Finished difference Result 889 states and 1660 transitions. [2024-10-12 21:25:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:25:54,038 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:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:54,042 INFO L225 Difference]: With dead ends: 889 [2024-10-12 21:25:54,042 INFO L226 Difference]: Without dead ends: 851 [2024-10-12 21:25:54,043 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:54,044 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:54,044 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:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-10-12 21:25:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 816. [2024-10-12 21:25:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.8697788697788698) internal successors, (1522), 815 states have internal predecessors, (1522), 0 states have call successors, (0), 0 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:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1522 transitions. [2024-10-12 21:25:54,066 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1522 transitions. Word has length 19 [2024-10-12 21:25:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:54,067 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1522 transitions. [2024-10-12 21:25:54,067 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:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1522 transitions. [2024-10-12 21:25:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 21:25:54,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:54,070 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:54,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:25:54,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:54,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1796642934, now seen corresponding path program 1 times [2024-10-12 21:25:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629606817] [2024-10-12 21:25:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:54,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:54,255 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:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629606817] [2024-10-12 21:25:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629606817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:54,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:54,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149740954] [2024-10-12 21:25:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:54,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:54,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:54,258 INFO L87 Difference]: Start difference. First operand 816 states and 1522 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:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:54,476 INFO L93 Difference]: Finished difference Result 1096 states and 1970 transitions. [2024-10-12 21:25:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:25:54,477 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:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:54,483 INFO L225 Difference]: With dead ends: 1096 [2024-10-12 21:25:54,483 INFO L226 Difference]: Without dead ends: 1061 [2024-10-12 21:25:54,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:25:54,490 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:54,490 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:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-10-12 21:25:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 849. [2024-10-12 21:25:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.859504132231405) internal successors, (1575), 848 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1575 transitions. [2024-10-12 21:25:54,510 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1575 transitions. Word has length 41 [2024-10-12 21:25:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:54,513 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1575 transitions. [2024-10-12 21:25:54,513 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:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1575 transitions. [2024-10-12 21:25:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 21:25:54,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:54,516 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:54,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:25:54,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:54,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -125681594, now seen corresponding path program 1 times [2024-10-12 21:25:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236097908] [2024-10-12 21:25:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:54,608 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:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236097908] [2024-10-12 21:25:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236097908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:54,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628520377] [2024-10-12 21:25:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:54,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:54,611 INFO L87 Difference]: Start difference. First operand 849 states and 1575 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:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:54,648 INFO L93 Difference]: Finished difference Result 974 states and 1774 transitions. [2024-10-12 21:25:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:54,649 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:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:54,652 INFO L225 Difference]: With dead ends: 974 [2024-10-12 21:25:54,653 INFO L226 Difference]: Without dead ends: 906 [2024-10-12 21:25:54,655 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:54,657 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:54,659 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:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-12 21:25:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2024-10-12 21:25:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.8414634146341464) internal successors, (1661), 903 states have internal predecessors, (1661), 0 states have call successors, (0), 0 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:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1661 transitions. [2024-10-12 21:25:54,675 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1661 transitions. Word has length 43 [2024-10-12 21:25:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:54,676 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1661 transitions. [2024-10-12 21:25:54,676 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:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1661 transitions. [2024-10-12 21:25:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 21:25:54,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:54,680 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:54,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:25:54,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:54,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash -123536642, now seen corresponding path program 1 times [2024-10-12 21:25:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782338799] [2024-10-12 21:25:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:54,924 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:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782338799] [2024-10-12 21:25:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782338799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:25:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493188151] [2024-10-12 21:25:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:25:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:25:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:25:54,929 INFO L87 Difference]: Start difference. First operand 904 states and 1661 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:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:55,113 INFO L93 Difference]: Finished difference Result 1029 states and 1857 transitions. [2024-10-12 21:25:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:25:55,114 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:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:55,118 INFO L225 Difference]: With dead ends: 1029 [2024-10-12 21:25:55,118 INFO L226 Difference]: Without dead ends: 906 [2024-10-12 21:25:55,121 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:55,122 INFO L432 NwaCegarLoop]: 1513 mSDtfsCounter, 5916 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5916 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:25:55,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5916 Valid, 1666 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:25:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-12 21:25:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2024-10-12 21:25:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.8392461197339247) internal successors, (1659), 903 states have internal predecessors, (1659), 0 states have call successors, (0), 0 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:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1659 transitions. [2024-10-12 21:25:55,145 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1659 transitions. Word has length 43 [2024-10-12 21:25:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1659 transitions. [2024-10-12 21:25:55,147 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:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1659 transitions. [2024-10-12 21:25:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 21:25:55,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:55,150 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:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:25:55,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:55,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 336976631, now seen corresponding path program 1 times [2024-10-12 21:25:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518849197] [2024-10-12 21:25:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:55,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:55,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:55,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518849197] [2024-10-12 21:25:55,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518849197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:55,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:25:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912502048] [2024-10-12 21:25:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:55,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:25:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:25:55,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:25:55,294 INFO L87 Difference]: Start difference. First operand 904 states and 1659 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:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:55,339 INFO L93 Difference]: Finished difference Result 910 states and 1666 transitions. [2024-10-12 21:25:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:25:55,343 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:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:55,347 INFO L225 Difference]: With dead ends: 910 [2024-10-12 21:25:55,347 INFO L226 Difference]: Without dead ends: 908 [2024-10-12 21:25:55,347 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:55,348 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:55,349 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:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-10-12 21:25:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2024-10-12 21:25:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 906 states have (on average 1.8344370860927153) internal successors, (1662), 907 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1662 transitions. [2024-10-12 21:25:55,369 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1662 transitions. Word has length 44 [2024-10-12 21:25:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:55,370 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1662 transitions. [2024-10-12 21:25:55,370 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:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1662 transitions. [2024-10-12 21:25:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:55,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:55,371 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:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:25:55,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:55,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash 514996542, now seen corresponding path program 1 times [2024-10-12 21:25:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508996732] [2024-10-12 21:25:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:55,424 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:55,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:55,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508996732] [2024-10-12 21:25:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508996732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:55,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:55,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365203340] [2024-10-12 21:25:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:55,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:55,427 INFO L87 Difference]: Start difference. First operand 908 states and 1662 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:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:55,459 INFO L93 Difference]: Finished difference Result 1046 states and 1875 transitions. [2024-10-12 21:25:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:55,460 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:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:55,463 INFO L225 Difference]: With dead ends: 1046 [2024-10-12 21:25:55,464 INFO L226 Difference]: Without dead ends: 974 [2024-10-12 21:25:55,464 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:55,465 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:55,465 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:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-12 21:25:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2024-10-12 21:25:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 970 states have (on average 1.81340206185567) internal successors, (1759), 971 states have internal predecessors, (1759), 0 states have call successors, (0), 0 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:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1759 transitions. [2024-10-12 21:25:55,487 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1759 transitions. Word has length 45 [2024-10-12 21:25:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:55,487 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1759 transitions. [2024-10-12 21:25:55,488 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:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1759 transitions. [2024-10-12 21:25:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:55,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:55,489 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:55,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:25:55,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -70715586, now seen corresponding path program 1 times [2024-10-12 21:25:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275647991] [2024-10-12 21:25:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:55,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:55,547 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:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275647991] [2024-10-12 21:25:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275647991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:55,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646243325] [2024-10-12 21:25:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:55,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:55,550 INFO L87 Difference]: Start difference. First operand 972 states and 1759 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:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:55,585 INFO L93 Difference]: Finished difference Result 1326 states and 2299 transitions. [2024-10-12 21:25:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:55,586 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:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:55,591 INFO L225 Difference]: With dead ends: 1326 [2024-10-12 21:25:55,591 INFO L226 Difference]: Without dead ends: 1137 [2024-10-12 21:25:55,592 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:55,592 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:55,593 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:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-10-12 21:25:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2024-10-12 21:25:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1133 states have (on average 1.766107678729038) internal successors, (2001), 1134 states have internal predecessors, (2001), 0 states have call successors, (0), 0 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:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2001 transitions. [2024-10-12 21:25:55,620 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2001 transitions. Word has length 45 [2024-10-12 21:25:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:55,620 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 2001 transitions. [2024-10-12 21:25:55,621 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:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2001 transitions. [2024-10-12 21:25:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:55,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:55,622 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:55,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:25:55,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:55,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash 818017854, now seen corresponding path program 1 times [2024-10-12 21:25:55,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:55,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199731121] [2024-10-12 21:25:55,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:55,674 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:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199731121] [2024-10-12 21:25:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199731121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:55,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:55,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55822381] [2024-10-12 21:25:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:55,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:55,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:55,677 INFO L87 Difference]: Start difference. First operand 1135 states and 2001 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:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:55,719 INFO L93 Difference]: Finished difference Result 1791 states and 2983 transitions. [2024-10-12 21:25:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:55,720 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:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:55,725 INFO L225 Difference]: With dead ends: 1791 [2024-10-12 21:25:55,725 INFO L226 Difference]: Without dead ends: 1439 [2024-10-12 21:25:55,726 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:55,727 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:55,728 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:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-12 21:25:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2024-10-12 21:25:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1435 states have (on average 1.6982578397212544) internal successors, (2437), 1436 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2437 transitions. [2024-10-12 21:25:55,770 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2437 transitions. Word has length 45 [2024-10-12 21:25:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:55,771 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2437 transitions. [2024-10-12 21:25:55,771 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:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2437 transitions. [2024-10-12 21:25:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:25:55,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:55,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:55,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:25:55,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:55,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash 554940478, now seen corresponding path program 1 times [2024-10-12 21:25:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769152058] [2024-10-12 21:25:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:55,845 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:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769152058] [2024-10-12 21:25:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769152058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:55,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848583552] [2024-10-12 21:25:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:55,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:25:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:25:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:25:55,850 INFO L87 Difference]: Start difference. First operand 1437 states and 2437 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:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:25:55,898 INFO L93 Difference]: Finished difference Result 2649 states and 4207 transitions. [2024-10-12 21:25:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:25:55,899 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:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:25:55,906 INFO L225 Difference]: With dead ends: 2649 [2024-10-12 21:25:55,906 INFO L226 Difference]: Without dead ends: 1995 [2024-10-12 21:25:55,908 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:55,908 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:55,910 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:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-10-12 21:25:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2024-10-12 21:25:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1991 states have (on average 1.6137619286790557) internal successors, (3213), 1992 states have internal predecessors, (3213), 0 states have call successors, (0), 0 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:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3213 transitions. [2024-10-12 21:25:55,954 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3213 transitions. Word has length 45 [2024-10-12 21:25:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:25:55,955 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 3213 transitions. [2024-10-12 21:25:55,955 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:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3213 transitions. [2024-10-12 21:25:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:25:55,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:25:55,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:25:55,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:25:55,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:25:55,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:25:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2121035277, now seen corresponding path program 1 times [2024-10-12 21:25:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:25:55,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315704800] [2024-10-12 21:25:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:25:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:25:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:25:56,077 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:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:25:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315704800] [2024-10-12 21:25:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315704800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:25:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:25:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:25:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479553832] [2024-10-12 21:25:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:25:56,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:25:56,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:25:56,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:25:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:25:56,079 INFO L87 Difference]: Start difference. First operand 1993 states and 3213 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:26:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:01,475 INFO L93 Difference]: Finished difference Result 4248 states and 7522 transitions. [2024-10-12 21:26:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:26:01,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-12 21:26:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:01,490 INFO L225 Difference]: With dead ends: 4248 [2024-10-12 21:26:01,491 INFO L226 Difference]: Without dead ends: 3495 [2024-10-12 21:26:01,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:26:01,494 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 2364 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 6402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:01,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2364 Valid, 791 Invalid, 6402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-12 21:26:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2024-10-12 21:26:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2024-10-12 21:26:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3493 states have (on average 1.4855425135986258) internal successors, (5189), 3494 states have internal predecessors, (5189), 0 states have call successors, (0), 0 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:26:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 5189 transitions. [2024-10-12 21:26:01,570 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 5189 transitions. Word has length 60 [2024-10-12 21:26:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:01,570 INFO L471 AbstractCegarLoop]: Abstraction has 3495 states and 5189 transitions. [2024-10-12 21:26:01,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:26:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5189 transitions. [2024-10-12 21:26:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:01,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:01,572 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:26:01,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:26:01,572 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:01,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1873610167, now seen corresponding path program 1 times [2024-10-12 21:26:01,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:01,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406909014] [2024-10-12 21:26:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:01,709 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:26:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406909014] [2024-10-12 21:26:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406909014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628318372] [2024-10-12 21:26:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:01,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:01,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:01,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:01,711 INFO L87 Difference]: Start difference. First operand 3495 states and 5189 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:26:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:01,918 INFO L93 Difference]: Finished difference Result 8257 states and 12050 transitions. [2024-10-12 21:26:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:01,919 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:26:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:01,945 INFO L225 Difference]: With dead ends: 8257 [2024-10-12 21:26:01,945 INFO L226 Difference]: Without dead ends: 7391 [2024-10-12 21:26:01,949 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:26:01,951 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4637 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:01,951 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.1s Time] [2024-10-12 21:26:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2024-10-12 21:26:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 4535. [2024-10-12 21:26:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4533 states have (on average 1.471211118464593) internal successors, (6669), 4534 states have internal predecessors, (6669), 0 states have call successors, (0), 0 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:26:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6669 transitions. [2024-10-12 21:26:02,077 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6669 transitions. Word has length 61 [2024-10-12 21:26:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:02,078 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6669 transitions. [2024-10-12 21:26:02,078 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:26:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6669 transitions. [2024-10-12 21:26:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:02,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:02,079 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:26:02,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:26:02,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1287898039, now seen corresponding path program 1 times [2024-10-12 21:26:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790766082] [2024-10-12 21:26:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:02,196 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:26:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790766082] [2024-10-12 21:26:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790766082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:02,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:02,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554114969] [2024-10-12 21:26:02,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:02,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:02,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:02,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:02,199 INFO L87 Difference]: Start difference. First operand 4535 states and 6669 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:26:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:02,437 INFO L93 Difference]: Finished difference Result 9465 states and 13778 transitions. [2024-10-12 21:26:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:02,438 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:26:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:02,476 INFO L225 Difference]: With dead ends: 9465 [2024-10-12 21:26:02,476 INFO L226 Difference]: Without dead ends: 8255 [2024-10-12 21:26:02,480 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:26:02,481 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4672 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:02,482 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.1s Time] [2024-10-12 21:26:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2024-10-12 21:26:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 6175. [2024-10-12 21:26:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6173 states have (on average 1.4574761056212537) internal successors, (8997), 6174 states have internal predecessors, (8997), 0 states have call successors, (0), 0 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:26:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 8997 transitions. [2024-10-12 21:26:02,665 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 8997 transitions. Word has length 61 [2024-10-12 21:26:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:02,666 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 8997 transitions. [2024-10-12 21:26:02,666 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:26:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 8997 transitions. [2024-10-12 21:26:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:02,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:02,667 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:26:02,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:26:02,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:02,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2118335817, now seen corresponding path program 1 times [2024-10-12 21:26:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:02,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003604650] [2024-10-12 21:26:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:02,790 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:26:02,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:02,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003604650] [2024-10-12 21:26:02,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003604650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:02,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:02,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:02,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942478981] [2024-10-12 21:26:02,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:02,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:02,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:02,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:02,793 INFO L87 Difference]: Start difference. First operand 6175 states and 8997 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:26:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:03,024 INFO L93 Difference]: Finished difference Result 10673 states and 15498 transitions. [2024-10-12 21:26:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:03,025 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:26:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:03,044 INFO L225 Difference]: With dead ends: 10673 [2024-10-12 21:26:03,044 INFO L226 Difference]: Without dead ends: 9463 [2024-10-12 21:26:03,049 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:26:03,050 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4667 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:26:03,050 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:26:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9463 states. [2024-10-12 21:26:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9463 to 7383. [2024-10-12 21:26:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 7381 states have (on average 1.4519712776046607) internal successors, (10717), 7382 states have internal predecessors, (10717), 0 states have call successors, (0), 0 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:26:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 10717 transitions. [2024-10-12 21:26:03,252 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 10717 transitions. Word has length 61 [2024-10-12 21:26:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:03,252 INFO L471 AbstractCegarLoop]: Abstraction has 7383 states and 10717 transitions. [2024-10-12 21:26:03,252 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:26:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 10717 transitions. [2024-10-12 21:26:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:03,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:03,316 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:26:03,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:26:03,317 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:03,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1913554103, now seen corresponding path program 1 times [2024-10-12 21:26:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:03,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810306658] [2024-10-12 21:26:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:03,451 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:26:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810306658] [2024-10-12 21:26:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810306658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155039887] [2024-10-12 21:26:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:03,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:03,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:03,454 INFO L87 Difference]: Start difference. First operand 7383 states and 10717 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:26:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:03,762 INFO L93 Difference]: Finished difference Result 11881 states and 17218 transitions. [2024-10-12 21:26:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:03,762 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:26:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:03,784 INFO L225 Difference]: With dead ends: 11881 [2024-10-12 21:26:03,785 INFO L226 Difference]: Without dead ends: 10671 [2024-10-12 21:26:03,791 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:26:03,792 INFO L432 NwaCegarLoop]: 1565 mSDtfsCounter, 4639 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4639 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:03,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4639 Valid, 3339 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:26:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10671 states. [2024-10-12 21:26:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10671 to 8591. [2024-10-12 21:26:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.448014902782629) internal successors, (12437), 8590 states have internal predecessors, (12437), 0 states have call successors, (0), 0 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:26:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12437 transitions. [2024-10-12 21:26:04,034 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12437 transitions. Word has length 61 [2024-10-12 21:26:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:04,034 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12437 transitions. [2024-10-12 21:26:04,035 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:26:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12437 transitions. [2024-10-12 21:26:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 21:26:04,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:04,037 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:26:04,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:26:04,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:04,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1134695091, now seen corresponding path program 1 times [2024-10-12 21:26:04,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:04,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794255234] [2024-10-12 21:26:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:04,127 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:26:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:04,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794255234] [2024-10-12 21:26:04,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794255234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:04,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756470202] [2024-10-12 21:26:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:04,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:04,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:04,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:04,131 INFO L87 Difference]: Start difference. First operand 8591 states and 12437 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:26:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:04,263 INFO L93 Difference]: Finished difference Result 14899 states and 21431 transitions. [2024-10-12 21:26:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:04,264 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:26:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:04,281 INFO L225 Difference]: With dead ends: 14899 [2024-10-12 21:26:04,282 INFO L226 Difference]: Without dead ends: 8593 [2024-10-12 21:26:04,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:26:04,292 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:26:04,292 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:26:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2024-10-12 21:26:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 8591. [2024-10-12 21:26:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.4335778321108394) internal successors, (12313), 8590 states have internal predecessors, (12313), 0 states have call successors, (0), 0 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:26:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12313 transitions. [2024-10-12 21:26:04,558 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12313 transitions. Word has length 62 [2024-10-12 21:26:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:04,559 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12313 transitions. [2024-10-12 21:26:04,559 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:26:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12313 transitions. [2024-10-12 21:26:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 21:26:04,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:04,560 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:26:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:26:04,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 558947071, now seen corresponding path program 1 times [2024-10-12 21:26:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481057158] [2024-10-12 21:26:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:04,642 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:26:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481057158] [2024-10-12 21:26:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481057158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:04,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:04,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:04,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554546413] [2024-10-12 21:26:04,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:04,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:04,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:04,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:04,644 INFO L87 Difference]: Start difference. First operand 8591 states and 12313 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:26:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:04,719 INFO L93 Difference]: Finished difference Result 10987 states and 15720 transitions. [2024-10-12 21:26:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:04,720 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:26:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:04,733 INFO L225 Difference]: With dead ends: 10987 [2024-10-12 21:26:04,733 INFO L226 Difference]: Without dead ends: 4681 [2024-10-12 21:26:04,741 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:26:04,741 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:26:04,741 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:26:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2024-10-12 21:26:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4674. [2024-10-12 21:26:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4672 states have (on average 1.4554794520547945) internal successors, (6800), 4673 states have internal predecessors, (6800), 0 states have call successors, (0), 0 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:26:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 6800 transitions. [2024-10-12 21:26:04,833 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 6800 transitions. Word has length 63 [2024-10-12 21:26:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:04,833 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 6800 transitions. [2024-10-12 21:26:04,834 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:26:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 6800 transitions. [2024-10-12 21:26:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 21:26:04,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:04,835 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:26:04,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:26:04,835 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:04,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1485090395, now seen corresponding path program 1 times [2024-10-12 21:26:04,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:04,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453779638] [2024-10-12 21:26:04,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:04,915 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:26:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453779638] [2024-10-12 21:26:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453779638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063781963] [2024-10-12 21:26:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:04,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:04,917 INFO L87 Difference]: Start difference. First operand 4674 states and 6800 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:26:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:04,964 INFO L93 Difference]: Finished difference Result 5866 states and 8474 transitions. [2024-10-12 21:26:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:04,964 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:26:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:04,971 INFO L225 Difference]: With dead ends: 5866 [2024-10-12 21:26:04,972 INFO L226 Difference]: Without dead ends: 3488 [2024-10-12 21:26:04,975 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:26:04,975 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:26:04,976 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:26:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2024-10-12 21:26:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3486. [2024-10-12 21:26:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3484 states have (on average 1.465556831228473) internal successors, (5106), 3485 states have internal predecessors, (5106), 0 states have call successors, (0), 0 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:26:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5106 transitions. [2024-10-12 21:26:05,039 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5106 transitions. Word has length 64 [2024-10-12 21:26:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:05,039 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 5106 transitions. [2024-10-12 21:26:05,039 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:26:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5106 transitions. [2024-10-12 21:26:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:26:05,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:05,041 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:26:05,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:26:05,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:05,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1800255255, now seen corresponding path program 1 times [2024-10-12 21:26:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874184915] [2024-10-12 21:26:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:05,118 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:26:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874184915] [2024-10-12 21:26:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874184915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:05,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:05,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65882292] [2024-10-12 21:26:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:05,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:05,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:05,121 INFO L87 Difference]: Start difference. First operand 3486 states and 5106 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:26:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:05,157 INFO L93 Difference]: Finished difference Result 4084 states and 5933 transitions. [2024-10-12 21:26:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:05,157 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:26:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:05,163 INFO L225 Difference]: With dead ends: 4084 [2024-10-12 21:26:05,163 INFO L226 Difference]: Without dead ends: 2894 [2024-10-12 21:26:05,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:26:05,165 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:26:05,166 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:26:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2024-10-12 21:26:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2892. [2024-10-12 21:26:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2890 states have (on average 1.4775086505190311) internal successors, (4270), 2891 states have internal predecessors, (4270), 0 states have call successors, (0), 0 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:26:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 4270 transitions. [2024-10-12 21:26:05,211 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 4270 transitions. Word has length 66 [2024-10-12 21:26:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:05,212 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 4270 transitions. [2024-10-12 21:26:05,212 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:26:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 4270 transitions. [2024-10-12 21:26:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 21:26:05,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:05,213 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:26:05,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:26:05,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:05,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash -200565513, now seen corresponding path program 1 times [2024-10-12 21:26:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:05,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070859454] [2024-10-12 21:26:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:05,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:05,353 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:26:05,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:05,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070859454] [2024-10-12 21:26:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070859454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:05,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617126563] [2024-10-12 21:26:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:05,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:05,357 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:26:05,358 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:26:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:05,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 21:26:05,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:05,587 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:26:05,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:05,916 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:26:05,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617126563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:05,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2024-10-12 21:26:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598880148] [2024-10-12 21:26:05,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:05,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:26:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:26:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:26:05,919 INFO L87 Difference]: Start difference. First operand 2892 states and 4270 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:26:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:06,031 INFO L93 Difference]: Finished difference Result 4320 states and 6180 transitions. [2024-10-12 21:26:06,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:06,032 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:26:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:06,038 INFO L225 Difference]: With dead ends: 4320 [2024-10-12 21:26:06,038 INFO L226 Difference]: Without dead ends: 3724 [2024-10-12 21:26:06,040 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:26:06,040 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 4454 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4454 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:06,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4454 Valid, 3184 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-10-12 21:26:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3667. [2024-10-12 21:26:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 3665 states have (on average 1.430286493860846) internal successors, (5242), 3666 states have internal predecessors, (5242), 0 states have call successors, (0), 0 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:26:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 5242 transitions. [2024-10-12 21:26:06,106 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 5242 transitions. Word has length 68 [2024-10-12 21:26:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:06,106 INFO L471 AbstractCegarLoop]: Abstraction has 3667 states and 5242 transitions. [2024-10-12 21:26:06,106 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:26:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 5242 transitions. [2024-10-12 21:26:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:26:06,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:06,108 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:26:06,127 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:26:06,308 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:26:06,309 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1703842709, now seen corresponding path program 1 times [2024-10-12 21:26:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055431092] [2024-10-12 21:26:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:06,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:07,875 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:26:07,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:07,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055431092] [2024-10-12 21:26:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055431092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836936661] [2024-10-12 21:26:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:07,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:07,878 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:26:07,879 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:26:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:07,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 21:26:07,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:08,456 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:26:08,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:09,384 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:26:09,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836936661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:09,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:09,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2024-10-12 21:26:09,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636600791] [2024-10-12 21:26:09,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:09,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-12 21:26:09,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:09,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 21:26:09,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2024-10-12 21:26:09,387 INFO L87 Difference]: Start difference. First operand 3667 states and 5242 transitions. Second operand has 32 states, 32 states have (on average 5.5625) internal successors, (178), 32 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:26:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:10,511 INFO L93 Difference]: Finished difference Result 6307 states and 8696 transitions. [2024-10-12 21:26:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 21:26:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.5625) internal successors, (178), 32 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:26:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:10,521 INFO L225 Difference]: With dead ends: 6307 [2024-10-12 21:26:10,521 INFO L226 Difference]: Without dead ends: 5063 [2024-10-12 21:26:10,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=473, Invalid=1783, Unknown=0, NotChecked=0, Total=2256 [2024-10-12 21:26:10,525 INFO L432 NwaCegarLoop]: 1496 mSDtfsCounter, 20919 mSDsluCounter, 6265 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20919 SdHoareTripleChecker+Valid, 7761 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:10,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20919 Valid, 7761 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:26:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2024-10-12 21:26:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 5017. [2024-10-12 21:26:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 5015 states have (on average 1.3850448654037886) internal successors, (6946), 5016 states have internal predecessors, (6946), 0 states have call successors, (0), 0 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:26:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 6946 transitions. [2024-10-12 21:26:10,668 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 6946 transitions. Word has length 69 [2024-10-12 21:26:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:10,669 INFO L471 AbstractCegarLoop]: Abstraction has 5017 states and 6946 transitions. [2024-10-12 21:26:10,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.5625) internal successors, (178), 32 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:26:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 6946 transitions. [2024-10-12 21:26:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:26:10,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:10,670 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:26:10,687 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:26:10,871 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:26:10,871 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:10,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1884833821, now seen corresponding path program 1 times [2024-10-12 21:26:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:10,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502414143] [2024-10-12 21:26:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:12,225 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:26:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:12,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502414143] [2024-10-12 21:26:12,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502414143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:12,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223799498] [2024-10-12 21:26:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:12,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:12,229 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:26:12,231 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:26:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:12,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 21:26:12,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:12,658 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:26:12,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:13,395 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:26:13,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223799498] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:13,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:13,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-10-12 21:26:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719089557] [2024-10-12 21:26:13,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:13,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 21:26:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:13,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 21:26:13,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-10-12 21:26:13,398 INFO L87 Difference]: Start difference. First operand 5017 states and 6946 transitions. Second operand has 29 states, 29 states have (on average 6.172413793103448) internal successors, (179), 28 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:26:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:14,602 INFO L93 Difference]: Finished difference Result 15556 states and 20477 transitions. [2024-10-12 21:26:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-12 21:26:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.172413793103448) internal successors, (179), 28 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:26:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:14,621 INFO L225 Difference]: With dead ends: 15556 [2024-10-12 21:26:14,621 INFO L226 Difference]: Without dead ends: 12991 [2024-10-12 21:26:14,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=615, Invalid=2465, Unknown=0, NotChecked=0, Total=3080 [2024-10-12 21:26:14,628 INFO L432 NwaCegarLoop]: 1494 mSDtfsCounter, 21419 mSDsluCounter, 6372 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21419 SdHoareTripleChecker+Valid, 7866 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:14,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21419 Valid, 7866 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:26:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2024-10-12 21:26:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 12979. [2024-10-12 21:26:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12979 states, 12977 states have (on average 1.3112429683285813) internal successors, (17016), 12978 states have internal predecessors, (17016), 0 states have call successors, (0), 0 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:26:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12979 states to 12979 states and 17016 transitions. [2024-10-12 21:26:14,969 INFO L78 Accepts]: Start accepts. Automaton has 12979 states and 17016 transitions. Word has length 69 [2024-10-12 21:26:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:14,970 INFO L471 AbstractCegarLoop]: Abstraction has 12979 states and 17016 transitions. [2024-10-12 21:26:14,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.172413793103448) internal successors, (179), 28 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:26:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12979 states and 17016 transitions. [2024-10-12 21:26:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:26:14,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:14,972 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:26:14,989 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:26:15,175 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:26:15,176 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:15,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1383295715, now seen corresponding path program 1 times [2024-10-12 21:26:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484284154] [2024-10-12 21:26:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:15,995 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:26:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:15,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484284154] [2024-10-12 21:26:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484284154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:15,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135453043] [2024-10-12 21:26:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:15,999 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:26:16,000 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:26:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:16,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 21:26:16,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:16,429 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:26:16,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:16,938 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:26:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135453043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:16,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-10-12 21:26:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305269209] [2024-10-12 21:26:16,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:16,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 21:26:16,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 21:26:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2024-10-12 21:26:16,940 INFO L87 Difference]: Start difference. First operand 12979 states and 17016 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:26:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:18,461 INFO L93 Difference]: Finished difference Result 34404 states and 44466 transitions. [2024-10-12 21:26:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-12 21:26:18,461 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:26:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:18,496 INFO L225 Difference]: With dead ends: 34404 [2024-10-12 21:26:18,496 INFO L226 Difference]: Without dead ends: 25249 [2024-10-12 21:26:18,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=714, Invalid=2708, Unknown=0, NotChecked=0, Total=3422 [2024-10-12 21:26:18,514 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 21528 mSDsluCounter, 6333 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21528 SdHoareTripleChecker+Valid, 7848 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:18,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21528 Valid, 7848 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:26:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25249 states. [2024-10-12 21:26:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25249 to 24049. [2024-10-12 21:26:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24049 states, 24047 states have (on average 1.276791283736017) internal successors, (30703), 24048 states have internal predecessors, (30703), 0 states have call successors, (0), 0 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:26:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24049 states to 24049 states and 30703 transitions. [2024-10-12 21:26:19,260 INFO L78 Accepts]: Start accepts. Automaton has 24049 states and 30703 transitions. Word has length 69 [2024-10-12 21:26:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:19,260 INFO L471 AbstractCegarLoop]: Abstraction has 24049 states and 30703 transitions. [2024-10-12 21:26:19,261 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:26:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 24049 states and 30703 transitions. [2024-10-12 21:26:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 21:26:19,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:19,262 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:26:19,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 21:26:19,462 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:26:19,463 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1292347099, now seen corresponding path program 1 times [2024-10-12 21:26:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093251562] [2024-10-12 21:26:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:19,829 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:26:19,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093251562] [2024-10-12 21:26:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093251562] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230637131] [2024-10-12 21:26:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:19,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:19,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:19,831 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:26:19,832 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:26:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:19,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-12 21:26:19,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:21,981 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:26:21,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:24,647 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:26:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230637131] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:24,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 21] total 49 [2024-10-12 21:26:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232904180] [2024-10-12 21:26:24,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:24,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-12 21:26:24,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:24,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 21:26:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2035, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 21:26:24,649 INFO L87 Difference]: Start difference. First operand 24049 states and 30703 transitions. Second operand has 49 states, 49 states have (on average 4.040816326530612) internal successors, (198), 49 states have internal predecessors, (198), 0 states have call successors, (0), 0 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:26:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:55,544 INFO L93 Difference]: Finished difference Result 71272 states and 91905 transitions. [2024-10-12 21:26:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-10-12 21:26:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.040816326530612) internal successors, (198), 49 states have internal predecessors, (198), 0 states have call successors, (0), 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:26:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:55,614 INFO L225 Difference]: With dead ends: 71272 [2024-10-12 21:26:55,615 INFO L226 Difference]: Without dead ends: 52676 [2024-10-12 21:26:55,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16715 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=8336, Invalid=34306, Unknown=0, NotChecked=0, Total=42642 [2024-10-12 21:26:55,646 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 31553 mSDsluCounter, 14962 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31553 SdHoareTripleChecker+Valid, 16517 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:55,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31553 Valid, 16517 Invalid, 2885 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [150 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:26:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52676 states. [2024-10-12 21:26:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52676 to 21879. [2024-10-12 21:26:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21879 states, 21877 states have (on average 1.2656214288979293) internal successors, (27688), 21878 states have internal predecessors, (27688), 0 states have call successors, (0), 0 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:26:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21879 states to 21879 states and 27688 transitions. [2024-10-12 21:26:56,600 INFO L78 Accepts]: Start accepts. Automaton has 21879 states and 27688 transitions. Word has length 70 [2024-10-12 21:26:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:56,601 INFO L471 AbstractCegarLoop]: Abstraction has 21879 states and 27688 transitions. [2024-10-12 21:26:56,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.040816326530612) internal successors, (198), 49 states have internal predecessors, (198), 0 states have call successors, (0), 0 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:26:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 21879 states and 27688 transitions. [2024-10-12 21:26:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 21:26:56,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:56,603 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:26:56,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 21:26:56,806 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:26:56,807 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:56,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -993642665, now seen corresponding path program 1 times [2024-10-12 21:26:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242136420] [2024-10-12 21:26:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:59,412 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:26:59,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242136420] [2024-10-12 21:26:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242136420] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746195698] [2024-10-12 21:26:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:59,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:59,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:59,414 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:26:59,415 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:26:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:59,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 21:26:59,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:27:00,882 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:27:00,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:27:03,013 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:27:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746195698] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:27:03,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:27:03,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 17] total 58 [2024-10-12 21:27:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812632968] [2024-10-12 21:27:03,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:27:03,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-12 21:27:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:27:03,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-12 21:27:03,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3072, Unknown=0, NotChecked=0, Total=3306 [2024-10-12 21:27:03,017 INFO L87 Difference]: Start difference. First operand 21879 states and 27688 transitions. Second operand has 58 states, 58 states have (on average 3.2586206896551726) internal successors, (189), 58 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)