./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1489629cdc9e883b5f9b8dace01f7ff19076a70dfbf3cfc1395e8493a3e654 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:57:06,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:57:06,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:57:06,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:57:06,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:57:06,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:57:06,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:57:06,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:57:06,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:57:06,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:57:06,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:57:06,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:57:06,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:57:06,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:57:06,212 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:57:06,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:57:06,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:57:06,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:57:06,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:57:06,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:57:06,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:57:06,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:57:06,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:57:06,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:57:06,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:57:06,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:57:06,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:57:06,218 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:57:06,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:57:06,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:57:06,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:57:06,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:57:06,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:57:06,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:57:06,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:57:06,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:57:06,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:57:06,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:57:06,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:57:06,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:57:06,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:57:06,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:57:06,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e1489629cdc9e883b5f9b8dace01f7ff19076a70dfbf3cfc1395e8493a3e654 [2024-10-11 04:57:06,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:57:06,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:57:06,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:57:06,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:57:06,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:57:06,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c [2024-10-11 04:57:07,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:57:08,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:57:08,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c [2024-10-11 04:57:08,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ecb94abd9/584b92f285e64dff9fe25672a099fb25/FLAG978e073c2 [2024-10-11 04:57:08,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ecb94abd9/584b92f285e64dff9fe25672a099fb25 [2024-10-11 04:57:08,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:57:08,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:57:08,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:57:08,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:57:08,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:57:08,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:57:08" (1/1) ... [2024-10-11 04:57:08,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed3f6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:08, skipping insertion in model container [2024-10-11 04:57:08,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:57:08" (1/1) ... [2024-10-11 04:57:08,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:57:08,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[26897,26910] [2024-10-11 04:57:08,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[34187,34200] [2024-10-11 04:57:09,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:57:09,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:57:09,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.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[26897,26910] [2024-10-11 04:57:09,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c[34187,34200] [2024-10-11 04:57:09,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:57:09,637 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:57:09,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09 WrapperNode [2024-10-11 04:57:09,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:57:09,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:57:09,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:57:09,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:57:09,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:09,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:09,938 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5294 [2024-10-11 04:57:09,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:57:09,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:57:09,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:57:09,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:57:09,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:09,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:09,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,184 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:57:10,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:57:10,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:57:10,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:57:10,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:57:10,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (1/1) ... [2024-10-11 04:57:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:57:10,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:57:10,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:57:10,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:57:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:57:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:57:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:57:10,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:57:10,596 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:57:10,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:57:13,850 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-11 04:57:13,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:57:13,912 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:57:13,914 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:57:13,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:57:13 BoogieIcfgContainer [2024-10-11 04:57:13,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:57:13,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:57:13,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:57:13,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:57:13,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:57:08" (1/3) ... [2024-10-11 04:57:13,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41019f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:57:13, skipping insertion in model container [2024-10-11 04:57:13,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:57:09" (2/3) ... [2024-10-11 04:57:13,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41019f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:57:13, skipping insertion in model container [2024-10-11 04:57:13,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:57:13" (3/3) ... [2024-10-11 04:57:13,922 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label02.c [2024-10-11 04:57:13,935 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:57:13,935 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:57:14,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:57:14,016 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;@4f9875d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:57:14,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:57:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 882 states, 879 states have (on average 1.9704209328782707) internal successors, (1732), 881 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:57:14,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:14,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:14,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:14,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash -31988621, now seen corresponding path program 1 times [2024-10-11 04:57:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:14,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030543668] [2024-10-11 04:57:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:14,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030543668] [2024-10-11 04:57:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030543668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:14,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:57:14,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583243354] [2024-10-11 04:57:14,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:14,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:57:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:14,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:57:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:57:14,348 INFO L87 Difference]: Start difference. First operand has 882 states, 879 states have (on average 1.9704209328782707) internal successors, (1732), 881 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:14,431 INFO L93 Difference]: Finished difference Result 1699 states and 3336 transitions. [2024-10-11 04:57:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:57:14,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 04:57:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:14,450 INFO L225 Difference]: With dead ends: 1699 [2024-10-11 04:57:14,450 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 04:57:14,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:57:14,457 INFO L432 NwaCegarLoop]: 1661 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, 1661 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-11 04:57:14,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1661 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 04:57:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-11 04:57:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8961187214611872) internal successors, (1661), 877 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-11 04:57:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1661 transitions. [2024-10-11 04:57:14,523 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1661 transitions. Word has length 27 [2024-10-11 04:57:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:14,523 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1661 transitions. [2024-10-11 04:57:14,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1661 transitions. [2024-10-11 04:57:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:57:14,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:14,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:14,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:57:14,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:14,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1837426955, now seen corresponding path program 1 times [2024-10-11 04:57:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487741292] [2024-10-11 04:57:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487741292] [2024-10-11 04:57:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487741292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:14,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:14,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:57:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291519283] [2024-10-11 04:57:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:57:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:14,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:57:14,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:14,733 INFO L87 Difference]: Start difference. First operand 878 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:14,888 INFO L93 Difference]: Finished difference Result 940 states and 1760 transitions. [2024-10-11 04:57:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:57:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 04:57:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:14,892 INFO L225 Difference]: With dead ends: 940 [2024-10-11 04:57:14,893 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 04:57:14,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:14,894 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 0 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4909 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:14,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4909 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 04:57:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-11 04:57:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.82648401826484) internal successors, (1600), 877 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1600 transitions. [2024-10-11 04:57:14,920 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1600 transitions. Word has length 27 [2024-10-11 04:57:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:14,921 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1600 transitions. [2024-10-11 04:57:14,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1600 transitions. [2024-10-11 04:57:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 04:57:14,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:14,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:14,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:57:14,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:14,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash 630448219, now seen corresponding path program 1 times [2024-10-11 04:57:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602528335] [2024-10-11 04:57:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:15,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:15,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602528335] [2024-10-11 04:57:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602528335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021477265] [2024-10-11 04:57:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:15,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:57:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:57:15,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:15,149 INFO L87 Difference]: Start difference. First operand 878 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 15.5) 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-11 04:57:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:20,052 INFO L93 Difference]: Finished difference Result 3133 states and 5909 transitions. [2024-10-11 04:57:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:57:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) 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-11 04:57:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:20,060 INFO L225 Difference]: With dead ends: 3133 [2024-10-11 04:57:20,060 INFO L226 Difference]: Without dead ends: 2380 [2024-10-11 04:57:20,061 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-11 04:57:20,061 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 2498 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5521 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2498 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:20,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2498 Valid, 869 Invalid, 6621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5521 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 04:57:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-10-11 04:57:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2024-10-11 04:57:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2378 states have (on average 1.5668629100084104) internal successors, (3726), 2379 states have internal predecessors, (3726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3726 transitions. [2024-10-11 04:57:20,102 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3726 transitions. Word has length 62 [2024-10-11 04:57:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:20,106 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3726 transitions. [2024-10-11 04:57:20,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) 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-11 04:57:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3726 transitions. [2024-10-11 04:57:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:57:20,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:20,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:20,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:57:20,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -470628699, now seen corresponding path program 1 times [2024-10-11 04:57:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172156748] [2024-10-11 04:57:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:20,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172156748] [2024-10-11 04:57:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172156748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50405065] [2024-10-11 04:57:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:20,401 INFO L87 Difference]: Start difference. First operand 2380 states and 3726 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:20,828 INFO L93 Difference]: Finished difference Result 3324 states and 5262 transitions. [2024-10-11 04:57:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 04:57:20,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 04:57:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:20,838 INFO L225 Difference]: With dead ends: 3324 [2024-10-11 04:57:20,838 INFO L226 Difference]: Without dead ends: 3265 [2024-10-11 04:57:20,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:57:20,840 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 13341 mSDsluCounter, 4679 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13341 SdHoareTripleChecker+Valid, 6272 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:20,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13341 Valid, 6272 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:57:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2024-10-11 04:57:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 2437. [2024-10-11 04:57:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2435 states have (on average 1.5683778234086243) internal successors, (3819), 2436 states have internal predecessors, (3819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3819 transitions. [2024-10-11 04:57:20,880 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3819 transitions. Word has length 87 [2024-10-11 04:57:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 3819 transitions. [2024-10-11 04:57:20,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3819 transitions. [2024-10-11 04:57:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:57:20,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:20,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:20,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:57:20,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:20,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1442819851, now seen corresponding path program 1 times [2024-10-11 04:57:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541436075] [2024-10-11 04:57:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541436075] [2024-10-11 04:57:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541436075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:21,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836778552] [2024-10-11 04:57:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:21,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:21,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:21,063 INFO L87 Difference]: Start difference. First operand 2437 states and 3819 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:21,098 INFO L93 Difference]: Finished difference Result 2658 states and 4178 transitions. [2024-10-11 04:57:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 04:57:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:21,109 INFO L225 Difference]: With dead ends: 2658 [2024-10-11 04:57:21,109 INFO L226 Difference]: Without dead ends: 2542 [2024-10-11 04:57:21,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:21,112 INFO L432 NwaCegarLoop]: 1595 mSDtfsCounter, 1504 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1685 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-11 04:57:21,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1685 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-10-11 04:57:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2540. [2024-10-11 04:57:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2538 states have (on average 1.570133963750985) internal successors, (3985), 2539 states have internal predecessors, (3985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3985 transitions. [2024-10-11 04:57:21,150 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3985 transitions. Word has length 89 [2024-10-11 04:57:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 3985 transitions. [2024-10-11 04:57:21,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3985 transitions. [2024-10-11 04:57:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:57:21,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:21,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:21,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:57:21,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1440674899, now seen corresponding path program 1 times [2024-10-11 04:57:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794824071] [2024-10-11 04:57:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794824071] [2024-10-11 04:57:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794824071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:21,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:21,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050995624] [2024-10-11 04:57:21,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:21,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:21,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:21,554 INFO L87 Difference]: Start difference. First operand 2540 states and 3985 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:21,907 INFO L93 Difference]: Finished difference Result 2761 states and 4341 transitions. [2024-10-11 04:57:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:21,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 04:57:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:21,916 INFO L225 Difference]: With dead ends: 2761 [2024-10-11 04:57:21,917 INFO L226 Difference]: Without dead ends: 2542 [2024-10-11 04:57:21,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:57:21,919 INFO L432 NwaCegarLoop]: 1587 mSDtfsCounter, 3092 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:21,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3092 Valid, 2243 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-10-11 04:57:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2540. [2024-10-11 04:57:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2538 states have (on average 1.5693459416863673) internal successors, (3983), 2539 states have internal predecessors, (3983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3983 transitions. [2024-10-11 04:57:21,959 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3983 transitions. Word has length 89 [2024-10-11 04:57:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:21,960 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 3983 transitions. [2024-10-11 04:57:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3983 transitions. [2024-10-11 04:57:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 04:57:21,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:21,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:21,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:57:21,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1840151110, now seen corresponding path program 1 times [2024-10-11 04:57:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513794849] [2024-10-11 04:57:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:22,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:22,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513794849] [2024-10-11 04:57:22,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513794849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:22,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:22,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:57:22,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172700849] [2024-10-11 04:57:22,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:22,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:57:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:22,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:57:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:22,111 INFO L87 Difference]: Start difference. First operand 2540 states and 3983 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:22,142 INFO L93 Difference]: Finished difference Result 2546 states and 3990 transitions. [2024-10-11 04:57:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:57:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 04:57:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:22,149 INFO L225 Difference]: With dead ends: 2546 [2024-10-11 04:57:22,149 INFO L226 Difference]: Without dead ends: 2544 [2024-10-11 04:57:22,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:57:22,150 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4780 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:22,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2024-10-11 04:57:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2024-10-11 04:57:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2542 states have (on average 1.5680566483084186) internal successors, (3986), 2543 states have internal predecessors, (3986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3986 transitions. [2024-10-11 04:57:22,183 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3986 transitions. Word has length 90 [2024-10-11 04:57:22,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:22,183 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 3986 transitions. [2024-10-11 04:57:22,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3986 transitions. [2024-10-11 04:57:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:22,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:22,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:22,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:57:22,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:22,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1591939181, now seen corresponding path program 1 times [2024-10-11 04:57:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557866330] [2024-10-11 04:57:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557866330] [2024-10-11 04:57:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557866330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:22,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:22,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965936073] [2024-10-11 04:57:22,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:22,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,274 INFO L87 Difference]: Start difference. First operand 2544 states and 3986 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:22,303 INFO L93 Difference]: Finished difference Result 2778 states and 4359 transitions. [2024-10-11 04:57:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:22,310 INFO L225 Difference]: With dead ends: 2778 [2024-10-11 04:57:22,310 INFO L226 Difference]: Without dead ends: 2658 [2024-10-11 04:57:22,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,311 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 1524 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:22,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1773 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-10-11 04:57:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2656. [2024-10-11 04:57:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2654 states have (on average 1.568575734740015) internal successors, (4163), 2655 states have internal predecessors, (4163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4163 transitions. [2024-10-11 04:57:22,346 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4163 transitions. Word has length 91 [2024-10-11 04:57:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 4163 transitions. [2024-10-11 04:57:22,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4163 transitions. [2024-10-11 04:57:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:22,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:22,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:22,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:57:22,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:22,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1666551661, now seen corresponding path program 1 times [2024-10-11 04:57:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841133414] [2024-10-11 04:57:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:22,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841133414] [2024-10-11 04:57:22,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841133414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:22,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:22,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:22,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143841012] [2024-10-11 04:57:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:22,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:22,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:22,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:22,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,408 INFO L87 Difference]: Start difference. First operand 2656 states and 4163 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:22,440 INFO L93 Difference]: Finished difference Result 3298 states and 5183 transitions. [2024-10-11 04:57:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:22,447 INFO L225 Difference]: With dead ends: 3298 [2024-10-11 04:57:22,448 INFO L226 Difference]: Without dead ends: 2965 [2024-10-11 04:57:22,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,449 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1522 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:22,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2024-10-11 04:57:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2024-10-11 04:57:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 2961 states have (on average 1.568726781492739) internal successors, (4645), 2962 states have internal predecessors, (4645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4645 transitions. [2024-10-11 04:57:22,492 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4645 transitions. Word has length 91 [2024-10-11 04:57:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:22,492 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 4645 transitions. [2024-10-11 04:57:22,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4645 transitions. [2024-10-11 04:57:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:22,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:22,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:22,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:57:22,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:22,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2011549037, now seen corresponding path program 1 times [2024-10-11 04:57:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864222523] [2024-10-11 04:57:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:22,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864222523] [2024-10-11 04:57:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864222523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:22,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160436368] [2024-10-11 04:57:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,557 INFO L87 Difference]: Start difference. First operand 2963 states and 4645 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:22,595 INFO L93 Difference]: Finished difference Result 4195 states and 6587 transitions. [2024-10-11 04:57:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:22,603 INFO L225 Difference]: With dead ends: 4195 [2024-10-11 04:57:22,603 INFO L226 Difference]: Without dead ends: 3555 [2024-10-11 04:57:22,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,605 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1518 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:22,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1775 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2024-10-11 04:57:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3553. [2024-10-11 04:57:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3551 states have (on average 1.5660377358490567) internal successors, (5561), 3552 states have internal predecessors, (5561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 5561 transitions. [2024-10-11 04:57:22,658 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 5561 transitions. Word has length 91 [2024-10-11 04:57:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:22,658 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 5561 transitions. [2024-10-11 04:57:22,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 5561 transitions. [2024-10-11 04:57:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:22,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:22,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:22,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:57:22,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:22,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1742965869, now seen corresponding path program 1 times [2024-10-11 04:57:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296502099] [2024-10-11 04:57:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296502099] [2024-10-11 04:57:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296502099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516870147] [2024-10-11 04:57:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,723 INFO L87 Difference]: Start difference. First operand 3553 states and 5561 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:22,776 INFO L93 Difference]: Finished difference Result 5917 states and 9251 transitions. [2024-10-11 04:57:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:22,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:22,783 INFO L225 Difference]: With dead ends: 5917 [2024-10-11 04:57:22,784 INFO L226 Difference]: Without dead ends: 4687 [2024-10-11 04:57:22,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,786 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 1516 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:22,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1777 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2024-10-11 04:57:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4685. [2024-10-11 04:57:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4685 states, 4683 states have (on average 1.5581891949604953) internal successors, (7297), 4684 states have internal predecessors, (7297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 7297 transitions. [2024-10-11 04:57:22,870 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 7297 transitions. Word has length 91 [2024-10-11 04:57:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:22,870 INFO L471 AbstractCegarLoop]: Abstraction has 4685 states and 7297 transitions. [2024-10-11 04:57:22,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 7297 transitions. [2024-10-11 04:57:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:22,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:22,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:22,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:57:22,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:22,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1782909805, now seen corresponding path program 1 times [2024-10-11 04:57:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:22,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044962464] [2024-10-11 04:57:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044962464] [2024-10-11 04:57:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044962464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:22,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:22,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757140575] [2024-10-11 04:57:22,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:22,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:22,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:22,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:22,935 INFO L87 Difference]: Start difference. First operand 4685 states and 7297 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:23,008 INFO L93 Difference]: Finished difference Result 9217 states and 14291 transitions. [2024-10-11 04:57:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:23,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:23,018 INFO L225 Difference]: With dead ends: 9217 [2024-10-11 04:57:23,018 INFO L226 Difference]: Without dead ends: 6855 [2024-10-11 04:57:23,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:23,022 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 1514 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:23,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6855 states. [2024-10-11 04:57:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6855 to 6853. [2024-10-11 04:57:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 6851 states have (on average 1.5438622098963655) internal successors, (10577), 6852 states have internal predecessors, (10577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 10577 transitions. [2024-10-11 04:57:23,212 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 10577 transitions. Word has length 91 [2024-10-11 04:57:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:23,212 INFO L471 AbstractCegarLoop]: Abstraction has 6853 states and 10577 transitions. [2024-10-11 04:57:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 10577 transitions. [2024-10-11 04:57:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:23,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:23,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:23,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:57:23,214 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:23,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1157253741, now seen corresponding path program 1 times [2024-10-11 04:57:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:23,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480964904] [2024-10-11 04:57:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:23,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:23,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480964904] [2024-10-11 04:57:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480964904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573615523] [2024-10-11 04:57:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:23,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:23,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:23,291 INFO L87 Difference]: Start difference. First operand 6853 states and 10577 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:23,462 INFO L93 Difference]: Finished difference Result 15529 states and 23795 transitions. [2024-10-11 04:57:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:23,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:23,479 INFO L225 Difference]: With dead ends: 15529 [2024-10-11 04:57:23,479 INFO L226 Difference]: Without dead ends: 10999 [2024-10-11 04:57:23,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:23,488 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1512 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:23,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1781 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10999 states. [2024-10-11 04:57:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10999 to 10997. [2024-10-11 04:57:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10997 states, 10995 states have (on average 1.5236925875397909) internal successors, (16753), 10996 states have internal predecessors, (16753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10997 states to 10997 states and 16753 transitions. [2024-10-11 04:57:23,696 INFO L78 Accepts]: Start accepts. Automaton has 10997 states and 16753 transitions. Word has length 91 [2024-10-11 04:57:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:23,696 INFO L471 AbstractCegarLoop]: Abstraction has 10997 states and 16753 transitions. [2024-10-11 04:57:23,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10997 states and 16753 transitions. [2024-10-11 04:57:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:23,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:23,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:23,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:57:23,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:23,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2045987181, now seen corresponding path program 1 times [2024-10-11 04:57:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491643326] [2024-10-11 04:57:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491643326] [2024-10-11 04:57:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491643326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:23,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680336997] [2024-10-11 04:57:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:23,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:23,754 INFO L87 Difference]: Start difference. First operand 10997 states and 16753 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:24,040 INFO L93 Difference]: Finished difference Result 27577 states and 41651 transitions. [2024-10-11 04:57:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:24,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:24,070 INFO L225 Difference]: With dead ends: 27577 [2024-10-11 04:57:24,070 INFO L226 Difference]: Without dead ends: 18903 [2024-10-11 04:57:24,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:24,081 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1510 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:24,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2024-10-11 04:57:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 18901. [2024-10-11 04:57:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18901 states, 18899 states have (on average 1.4993915021958835) internal successors, (28337), 18900 states have internal predecessors, (28337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18901 states to 18901 states and 28337 transitions. [2024-10-11 04:57:24,446 INFO L78 Accepts]: Start accepts. Automaton has 18901 states and 28337 transitions. Word has length 91 [2024-10-11 04:57:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:24,446 INFO L471 AbstractCegarLoop]: Abstraction has 18901 states and 28337 transitions. [2024-10-11 04:57:24,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18901 states and 28337 transitions. [2024-10-11 04:57:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:57:24,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:24,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:57:24,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1873031571, now seen corresponding path program 1 times [2024-10-11 04:57:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677743992] [2024-10-11 04:57:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:57:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677743992] [2024-10-11 04:57:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677743992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:24,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:57:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876564421] [2024-10-11 04:57:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:24,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:57:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:24,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:57:24,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:24,509 INFO L87 Difference]: Start difference. First operand 18901 states and 28337 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:25,027 INFO L93 Difference]: Finished difference Result 50521 states and 75059 transitions. [2024-10-11 04:57:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:57:25,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:57:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:25,085 INFO L225 Difference]: With dead ends: 50521 [2024-10-11 04:57:25,086 INFO L226 Difference]: Without dead ends: 33943 [2024-10-11 04:57:25,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:57:25,110 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 1520 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:25,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1781 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:57:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33943 states. [2024-10-11 04:57:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33943 to 33941. [2024-10-11 04:57:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33941 states, 33939 states have (on average 1.472317982262294) internal successors, (49969), 33940 states have internal predecessors, (49969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33941 states to 33941 states and 49969 transitions. [2024-10-11 04:57:25,879 INFO L78 Accepts]: Start accepts. Automaton has 33941 states and 49969 transitions. Word has length 91 [2024-10-11 04:57:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:25,879 INFO L471 AbstractCegarLoop]: Abstraction has 33941 states and 49969 transitions. [2024-10-11 04:57:25,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 33941 states and 49969 transitions. [2024-10-11 04:57:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:57:25,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:25,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:25,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:57:25,886 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:25,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1900714775, now seen corresponding path program 1 times [2024-10-11 04:57:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767174990] [2024-10-11 04:57:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:57:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767174990] [2024-10-11 04:57:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767174990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:26,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516149980] [2024-10-11 04:57:26,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:26,086 INFO L87 Difference]: Start difference. First operand 33941 states and 49969 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:30,436 INFO L93 Difference]: Finished difference Result 283559 states and 415674 transitions. [2024-10-11 04:57:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:30,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-11 04:57:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:30,971 INFO L225 Difference]: With dead ends: 283559 [2024-10-11 04:57:30,972 INFO L226 Difference]: Without dead ends: 261541 [2024-10-11 04:57:31,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:57:31,046 INFO L432 NwaCegarLoop]: 1693 mSDtfsCounter, 11678 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11678 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:31,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11678 Valid, 5224 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:57:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261541 states. [2024-10-11 04:57:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261541 to 60821. [2024-10-11 04:57:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60821 states, 60819 states have (on average 1.4635064700175933) internal successors, (89009), 60820 states have internal predecessors, (89009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60821 states to 60821 states and 89009 transitions. [2024-10-11 04:57:34,489 INFO L78 Accepts]: Start accepts. Automaton has 60821 states and 89009 transitions. Word has length 115 [2024-10-11 04:57:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:34,491 INFO L471 AbstractCegarLoop]: Abstraction has 60821 states and 89009 transitions. [2024-10-11 04:57:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 60821 states and 89009 transitions. [2024-10-11 04:57:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:57:34,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:34,498 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:34,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:57:34,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:34,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1975327255, now seen corresponding path program 1 times [2024-10-11 04:57:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:34,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954464713] [2024-10-11 04:57:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:57:34,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954464713] [2024-10-11 04:57:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954464713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:34,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641381746] [2024-10-11 04:57:34,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:34,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:34,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:34,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:34,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:34,732 INFO L87 Difference]: Start difference. First operand 60821 states and 89009 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:40,828 INFO L93 Difference]: Finished difference Result 315175 states and 461754 transitions. [2024-10-11 04:57:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-11 04:57:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:41,295 INFO L225 Difference]: With dead ends: 315175 [2024-10-11 04:57:41,295 INFO L226 Difference]: Without dead ends: 283557 [2024-10-11 04:57:41,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:57:41,363 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11680 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11680 SdHoareTripleChecker+Valid, 5181 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:41,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11680 Valid, 5181 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283557 states. [2024-10-11 04:57:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283557 to 103445. [2024-10-11 04:57:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103445 states, 103443 states have (on average 1.4581266977949208) internal successors, (150833), 103444 states have internal predecessors, (150833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103445 states to 103445 states and 150833 transitions. [2024-10-11 04:57:46,350 INFO L78 Accepts]: Start accepts. Automaton has 103445 states and 150833 transitions. Word has length 115 [2024-10-11 04:57:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 103445 states and 150833 transitions. [2024-10-11 04:57:46,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 103445 states and 150833 transitions. [2024-10-11 04:57:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:57:46,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:46,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:46,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:57:46,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:46,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1974642665, now seen corresponding path program 1 times [2024-10-11 04:57:46,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:46,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8059255] [2024-10-11 04:57:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:57:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8059255] [2024-10-11 04:57:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8059255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:57:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246518758] [2024-10-11 04:57:46,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:46,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:57:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:46,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:57:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:57:46,612 INFO L87 Difference]: Start difference. First operand 103445 states and 150833 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:54,261 INFO L93 Difference]: Finished difference Result 346791 states and 507706 transitions. [2024-10-11 04:57:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:57:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-11 04:57:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:54,804 INFO L225 Difference]: With dead ends: 346791 [2024-10-11 04:57:54,804 INFO L226 Difference]: Without dead ends: 315173 [2024-10-11 04:57:54,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:57:54,893 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 11722 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11722 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:54,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11722 Valid, 5175 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:57:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315173 states. [2024-10-11 04:58:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315173 to 135061. [2024-10-11 04:58:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135061 states, 135059 states have (on average 1.457029890640387) internal successors, (196785), 135060 states have internal predecessors, (196785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:58:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135061 states to 135061 states and 196785 transitions. [2024-10-11 04:58:00,918 INFO L78 Accepts]: Start accepts. Automaton has 135061 states and 196785 transitions. Word has length 115 [2024-10-11 04:58:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:58:00,918 INFO L471 AbstractCegarLoop]: Abstraction has 135061 states and 196785 transitions. [2024-10-11 04:58:00,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:58:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 135061 states and 196785 transitions. [2024-10-11 04:58:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:58:00,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:58:00,928 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:58:00,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:58:00,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:58:00,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:58:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2051741463, now seen corresponding path program 1 times [2024-10-11 04:58:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:58:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581500714] [2024-10-11 04:58:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:58:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:58:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:58:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:58:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:58:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581500714] [2024-10-11 04:58:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581500714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:58:01,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:58:01,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 04:58:01,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255171193] [2024-10-11 04:58:01,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:58:01,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 04:58:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:58:01,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 04:58:01,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:58:01,121 INFO L87 Difference]: Start difference. First operand 135061 states and 196785 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)