./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.ufo.BOUNDED-16.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 814707fd20d5e6c26ff7c37a631e7717aed30ef7e6a1e8c64960ffc8d41abd55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:38:43,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:38:43,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:38:43,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:38:43,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:38:43,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:38:43,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:38:43,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:38:43,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:38:43,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:38:43,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:38:43,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:38:43,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:38:43,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:38:43,868 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:38:43,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:38:43,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:38:43,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:38:43,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:38:43,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:38:43,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:38:43,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:38:43,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:38:43,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:38:43,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:38:43,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:38:43,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:38:43,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:38:43,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:38:43,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:38:43,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:38:43,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:38:43,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:38:43,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:38:43,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:38:43,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:38:43,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:38:43,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:38:43,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:38:43,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:38:43,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:38:43,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:38:43,877 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 814707fd20d5e6c26ff7c37a631e7717aed30ef7e6a1e8c64960ffc8d41abd55 [2024-10-12 21:38:44,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:38:44,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:38:44,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:38:44,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:38:44,165 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:38:44,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2024-10-12 21:38:45,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:38:46,166 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:38:46,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2024-10-12 21:38:46,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30cc3a25/271bc0dc706b46e88f0495f98f2c5a56/FLAGf1520506e [2024-10-12 21:38:46,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30cc3a25/271bc0dc706b46e88f0495f98f2c5a56 [2024-10-12 21:38:46,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:38:46,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:38:46,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:38:46,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:38:46,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:38:46,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:38:46" (1/1) ... [2024-10-12 21:38:46,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b22ae79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:46, skipping insertion in model container [2024-10-12 21:38:46,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:38:46" (1/1) ... [2024-10-12 21:38:46,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:38:46,829 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.ufo.BOUNDED-16.pals+Problem12_label05.c[26860,26873] [2024-10-12 21:38:46,888 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.ufo.BOUNDED-16.pals+Problem12_label05.c[33796,33809] [2024-10-12 21:38:47,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:38:47,552 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:38:47,596 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.ufo.BOUNDED-16.pals+Problem12_label05.c[26860,26873] [2024-10-12 21:38:47,604 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.ufo.BOUNDED-16.pals+Problem12_label05.c[33796,33809] [2024-10-12 21:38:48,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:38:48,038 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:38:48,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48 WrapperNode [2024-10-12 21:38:48,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:38:48,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:38:48,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:38:48,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:38:48,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,450 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5293 [2024-10-12 21:38:48,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:38:48,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:38:48,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:38:48,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:38:48,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,771 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:38:48,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:48,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:49,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:49,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:38:49,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:38:49,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:38:49,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:38:49,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (1/1) ... [2024-10-12 21:38:49,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:38:49,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:38:49,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:38:49,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:38:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:38:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:38:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:38:49,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:38:49,306 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:38:49,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:38:53,565 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-12 21:38:53,565 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:38:53,634 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:38:53,635 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:38:53,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:38:53 BoogieIcfgContainer [2024-10-12 21:38:53,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:38:53,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:38:53,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:38:53,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:38:53,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:38:46" (1/3) ... [2024-10-12 21:38:53,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bacd89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:38:53, skipping insertion in model container [2024-10-12 21:38:53,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:38:48" (2/3) ... [2024-10-12 21:38:53,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bacd89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:38:53, skipping insertion in model container [2024-10-12 21:38:53,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:38:53" (3/3) ... [2024-10-12 21:38:53,644 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2024-10-12 21:38:53,661 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:38:53,661 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:38:53,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:38:53,762 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;@2cce042f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:38:53,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:38:53,775 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-12 21:38:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 21:38:53,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:38:53,786 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-12 21:38:53,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:38:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:38:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash -31988621, now seen corresponding path program 1 times [2024-10-12 21:38:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:38:53,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10528023] [2024-10-12 21:38:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:38:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:38:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:38:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:38:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:38:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10528023] [2024-10-12 21:38:54,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10528023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:38:54,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:38:54,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:38:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105482982] [2024-10-12 21:38:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:38:54,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:38:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:38:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:38:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:38:54,139 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-12 21:38:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:38:54,256 INFO L93 Difference]: Finished difference Result 1699 states and 3336 transitions. [2024-10-12 21:38:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:38:54,259 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-12 21:38:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:38:54,283 INFO L225 Difference]: With dead ends: 1699 [2024-10-12 21:38:54,283 INFO L226 Difference]: Without dead ends: 878 [2024-10-12 21:38:54,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:38:54,295 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-12 21:38:54,296 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-12 21:38:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-12 21:38:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-12 21:38:54,373 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-12 21:38:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1661 transitions. [2024-10-12 21:38:54,381 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1661 transitions. Word has length 27 [2024-10-12 21:38:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:38:54,382 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1661 transitions. [2024-10-12 21:38:54,382 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-12 21:38:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1661 transitions. [2024-10-12 21:38:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 21:38:54,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:38:54,383 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-12 21:38:54,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:38:54,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:38:54,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:38:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1837426955, now seen corresponding path program 1 times [2024-10-12 21:38:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:38:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339296480] [2024-10-12 21:38:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:38:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:38:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:38:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:38:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:38:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339296480] [2024-10-12 21:38:54,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339296480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:38:54,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:38:54,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:38:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110485012] [2024-10-12 21:38:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:38:54,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:38:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:38:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:38:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:38:54,615 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-12 21:38:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:38:54,747 INFO L93 Difference]: Finished difference Result 940 states and 1760 transitions. [2024-10-12 21:38:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:38:54,748 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-12 21:38:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:38:54,752 INFO L225 Difference]: With dead ends: 940 [2024-10-12 21:38:54,752 INFO L226 Difference]: Without dead ends: 878 [2024-10-12 21:38:54,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:38:54,754 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-12 21:38:54,754 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-12 21:38:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-12 21:38:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-10-12 21:38:54,788 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-12 21:38:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1600 transitions. [2024-10-12 21:38:54,796 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1600 transitions. Word has length 27 [2024-10-12 21:38:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:38:54,796 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1600 transitions. [2024-10-12 21:38:54,796 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-12 21:38:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1600 transitions. [2024-10-12 21:38:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:38:54,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:38:54,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:38:54,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:38:54,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:38:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:38:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 992919510, now seen corresponding path program 1 times [2024-10-12 21:38:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:38:54,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236677813] [2024-10-12 21:38:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:38:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:38:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:38:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:38:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:38:55,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236677813] [2024-10-12 21:38:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236677813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:38:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:38:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:38:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546144234] [2024-10-12 21:38:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:38:55,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:38:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:38:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:38:55,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:38:55,086 INFO L87 Difference]: Start difference. First operand 878 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:00,891 INFO L93 Difference]: Finished difference Result 3133 states and 5909 transitions. [2024-10-12 21:39:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:39:00,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-12 21:39:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:00,901 INFO L225 Difference]: With dead ends: 3133 [2024-10-12 21:39:00,901 INFO L226 Difference]: Without dead ends: 2380 [2024-10-12 21:39:00,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:39:00,903 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 2516 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2516 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 6510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:00,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2516 Valid, 851 Invalid, 6510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1153 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-12 21:39:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-10-12 21:39:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2024-10-12 21:39:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2378 states have (on average 1.5618166526492852) internal successors, (3714), 2379 states have internal predecessors, (3714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3714 transitions. [2024-10-12 21:39:00,956 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3714 transitions. Word has length 59 [2024-10-12 21:39:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:00,957 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3714 transitions. [2024-10-12 21:39:00,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3714 transitions. [2024-10-12 21:39:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 21:39:00,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:00,961 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-12 21:39:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:39:00,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:00,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -470628699, now seen corresponding path program 1 times [2024-10-12 21:39:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638040760] [2024-10-12 21:39:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:01,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:01,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638040760] [2024-10-12 21:39:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638040760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:01,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:01,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:01,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187970454] [2024-10-12 21:39:01,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:01,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:01,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:01,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:01,363 INFO L87 Difference]: Start difference. First operand 2380 states and 3714 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-12 21:39:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:01,943 INFO L93 Difference]: Finished difference Result 3324 states and 5250 transitions. [2024-10-12 21:39:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:39:01,944 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-12 21:39:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:01,957 INFO L225 Difference]: With dead ends: 3324 [2024-10-12 21:39:01,957 INFO L226 Difference]: Without dead ends: 3265 [2024-10-12 21:39:01,961 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-12 21:39:01,964 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:01,967 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.3s Time] [2024-10-12 21:39:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2024-10-12 21:39:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 2437. [2024-10-12 21:39:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2435 states have (on average 1.5634496919917864) internal successors, (3807), 2436 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3807 transitions. [2024-10-12 21:39:02,029 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3807 transitions. Word has length 87 [2024-10-12 21:39:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:02,030 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 3807 transitions. [2024-10-12 21:39:02,030 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-12 21:39:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3807 transitions. [2024-10-12 21:39:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:39:02,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:02,033 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-12 21:39:02,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:39:02,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:02,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1442819851, now seen corresponding path program 1 times [2024-10-12 21:39:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572088224] [2024-10-12 21:39:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572088224] [2024-10-12 21:39:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572088224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:02,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821734256] [2024-10-12 21:39:02,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:02,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:02,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:02,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:02,220 INFO L87 Difference]: Start difference. First operand 2437 states and 3807 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-12 21:39:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:02,264 INFO L93 Difference]: Finished difference Result 2658 states and 4166 transitions. [2024-10-12 21:39:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:02,264 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-12 21:39:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:02,274 INFO L225 Difference]: With dead ends: 2658 [2024-10-12 21:39:02,274 INFO L226 Difference]: Without dead ends: 2542 [2024-10-12 21:39:02,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:02,276 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-12 21:39:02,277 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-12 21:39:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-10-12 21:39:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2540. [2024-10-12 21:39:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2538 states have (on average 1.5654058313632782) internal successors, (3973), 2539 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3973 transitions. [2024-10-12 21:39:02,326 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3973 transitions. Word has length 89 [2024-10-12 21:39:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:02,326 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 3973 transitions. [2024-10-12 21:39:02,327 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-12 21:39:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3973 transitions. [2024-10-12 21:39:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:39:02,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:02,328 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-12 21:39:02,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:39:02,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1440674899, now seen corresponding path program 1 times [2024-10-12 21:39:02,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:02,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140179394] [2024-10-12 21:39:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140179394] [2024-10-12 21:39:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140179394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889808871] [2024-10-12 21:39:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:02,890 INFO L87 Difference]: Start difference. First operand 2540 states and 3973 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-12 21:39:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:03,374 INFO L93 Difference]: Finished difference Result 2761 states and 4329 transitions. [2024-10-12 21:39:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:03,378 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-12 21:39:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:03,387 INFO L225 Difference]: With dead ends: 2761 [2024-10-12 21:39:03,387 INFO L226 Difference]: Without dead ends: 2542 [2024-10-12 21:39:03,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:39:03,390 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-12 21:39:03,391 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-12 21:39:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-10-12 21:39:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2540. [2024-10-12 21:39:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2538 states have (on average 1.5646178092986605) internal successors, (3971), 2539 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3971 transitions. [2024-10-12 21:39:03,443 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3971 transitions. Word has length 89 [2024-10-12 21:39:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:03,444 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 3971 transitions. [2024-10-12 21:39:03,444 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-12 21:39:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3971 transitions. [2024-10-12 21:39:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 21:39:03,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:03,445 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-12 21:39:03,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:39:03,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1840151110, now seen corresponding path program 1 times [2024-10-12 21:39:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887749243] [2024-10-12 21:39:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:03,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:03,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887749243] [2024-10-12 21:39:03,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887749243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:03,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:39:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859956520] [2024-10-12 21:39:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:03,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:39:03,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:03,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:39:03,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:03,666 INFO L87 Difference]: Start difference. First operand 2540 states and 3971 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-12 21:39:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:03,710 INFO L93 Difference]: Finished difference Result 2546 states and 3978 transitions. [2024-10-12 21:39:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:39:03,711 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-12 21:39:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:03,720 INFO L225 Difference]: With dead ends: 2546 [2024-10-12 21:39:03,720 INFO L226 Difference]: Without dead ends: 2544 [2024-10-12 21:39:03,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:03,723 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-12 21:39:03,723 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-12 21:39:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2024-10-12 21:39:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2024-10-12 21:39:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2542 states have (on average 1.5633359559402045) internal successors, (3974), 2543 states have internal predecessors, (3974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3974 transitions. [2024-10-12 21:39:03,771 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3974 transitions. Word has length 90 [2024-10-12 21:39:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:03,772 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 3974 transitions. [2024-10-12 21:39:03,772 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-12 21:39:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3974 transitions. [2024-10-12 21:39:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:03,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:03,774 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-12 21:39:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:39:03,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1591939181, now seen corresponding path program 1 times [2024-10-12 21:39:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899963458] [2024-10-12 21:39:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899963458] [2024-10-12 21:39:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899963458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:03,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756768457] [2024-10-12 21:39:03,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:03,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:03,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:03,872 INFO L87 Difference]: Start difference. First operand 2544 states and 3974 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-12 21:39:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:03,917 INFO L93 Difference]: Finished difference Result 2778 states and 4347 transitions. [2024-10-12 21:39:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:03,918 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-12 21:39:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:03,926 INFO L225 Difference]: With dead ends: 2778 [2024-10-12 21:39:03,927 INFO L226 Difference]: Without dead ends: 2658 [2024-10-12 21:39:03,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:03,929 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-12 21:39:03,929 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-12 21:39:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-10-12 21:39:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2656. [2024-10-12 21:39:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2654 states have (on average 1.5640542577241898) internal successors, (4151), 2655 states have internal predecessors, (4151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4151 transitions. [2024-10-12 21:39:04,020 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4151 transitions. Word has length 91 [2024-10-12 21:39:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:04,020 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 4151 transitions. [2024-10-12 21:39:04,021 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-12 21:39:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4151 transitions. [2024-10-12 21:39:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:04,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:04,021 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-12 21:39:04,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:39:04,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1666551661, now seen corresponding path program 1 times [2024-10-12 21:39:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573583322] [2024-10-12 21:39:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:04,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:04,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573583322] [2024-10-12 21:39:04,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573583322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:04,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:04,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738267704] [2024-10-12 21:39:04,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:04,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:04,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:04,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,115 INFO L87 Difference]: Start difference. First operand 2656 states and 4151 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-12 21:39:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:04,155 INFO L93 Difference]: Finished difference Result 3298 states and 5171 transitions. [2024-10-12 21:39:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:04,156 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-12 21:39:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:04,165 INFO L225 Difference]: With dead ends: 3298 [2024-10-12 21:39:04,165 INFO L226 Difference]: Without dead ends: 2965 [2024-10-12 21:39:04,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,167 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-12 21:39:04,167 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-12 21:39:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2024-10-12 21:39:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2024-10-12 21:39:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 2961 states have (on average 1.5646740965889903) internal successors, (4633), 2962 states have internal predecessors, (4633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4633 transitions. [2024-10-12 21:39:04,222 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4633 transitions. Word has length 91 [2024-10-12 21:39:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:04,222 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 4633 transitions. [2024-10-12 21:39:04,222 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-12 21:39:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4633 transitions. [2024-10-12 21:39:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:04,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:04,223 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-12 21:39:04,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:39:04,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2011549037, now seen corresponding path program 1 times [2024-10-12 21:39:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010456321] [2024-10-12 21:39:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010456321] [2024-10-12 21:39:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010456321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001660947] [2024-10-12 21:39:04,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:04,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:04,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:04,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,306 INFO L87 Difference]: Start difference. First operand 2963 states and 4633 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-12 21:39:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:04,359 INFO L93 Difference]: Finished difference Result 4195 states and 6575 transitions. [2024-10-12 21:39:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:04,360 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-12 21:39:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:04,372 INFO L225 Difference]: With dead ends: 4195 [2024-10-12 21:39:04,372 INFO L226 Difference]: Without dead ends: 3555 [2024-10-12 21:39:04,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,375 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-12 21:39:04,375 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-12 21:39:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2024-10-12 21:39:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3553. [2024-10-12 21:39:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3551 states have (on average 1.5626584060827935) internal successors, (5549), 3552 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 5549 transitions. [2024-10-12 21:39:04,453 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 5549 transitions. Word has length 91 [2024-10-12 21:39:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:04,454 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 5549 transitions. [2024-10-12 21:39:04,454 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-12 21:39:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 5549 transitions. [2024-10-12 21:39:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:04,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:04,455 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-12 21:39:04,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:39:04,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:04,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1742965869, now seen corresponding path program 1 times [2024-10-12 21:39:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:04,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837361971] [2024-10-12 21:39:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837361971] [2024-10-12 21:39:04,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837361971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:04,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:04,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846753787] [2024-10-12 21:39:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:04,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:04,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,547 INFO L87 Difference]: Start difference. First operand 3553 states and 5549 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-12 21:39:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:04,617 INFO L93 Difference]: Finished difference Result 5917 states and 9239 transitions. [2024-10-12 21:39:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:04,618 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-12 21:39:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:04,633 INFO L225 Difference]: With dead ends: 5917 [2024-10-12 21:39:04,635 INFO L226 Difference]: Without dead ends: 4687 [2024-10-12 21:39:04,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,639 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-12 21:39:04,640 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-12 21:39:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2024-10-12 21:39:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4685. [2024-10-12 21:39:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4685 states, 4683 states have (on average 1.5556267349989323) internal successors, (7285), 4684 states have internal predecessors, (7285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 7285 transitions. [2024-10-12 21:39:04,756 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 7285 transitions. Word has length 91 [2024-10-12 21:39:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:04,756 INFO L471 AbstractCegarLoop]: Abstraction has 4685 states and 7285 transitions. [2024-10-12 21:39:04,757 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-12 21:39:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 7285 transitions. [2024-10-12 21:39:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:04,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:04,759 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-12 21:39:04,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:39:04,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1782909805, now seen corresponding path program 1 times [2024-10-12 21:39:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:04,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995266686] [2024-10-12 21:39:04,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:04,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995266686] [2024-10-12 21:39:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995266686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:04,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751928882] [2024-10-12 21:39:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:04,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,844 INFO L87 Difference]: Start difference. First operand 4685 states and 7285 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-12 21:39:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:04,948 INFO L93 Difference]: Finished difference Result 9217 states and 14279 transitions. [2024-10-12 21:39:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:04,948 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-12 21:39:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:04,961 INFO L225 Difference]: With dead ends: 9217 [2024-10-12 21:39:04,961 INFO L226 Difference]: Without dead ends: 6855 [2024-10-12 21:39:04,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:04,967 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-12 21:39:04,968 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-12 21:39:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6855 states. [2024-10-12 21:39:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6855 to 6853. [2024-10-12 21:39:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 6851 states have (on average 1.5421106407823675) internal successors, (10565), 6852 states have internal predecessors, (10565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 10565 transitions. [2024-10-12 21:39:05,229 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 10565 transitions. Word has length 91 [2024-10-12 21:39:05,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:05,230 INFO L471 AbstractCegarLoop]: Abstraction has 6853 states and 10565 transitions. [2024-10-12 21:39:05,230 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-12 21:39:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 10565 transitions. [2024-10-12 21:39:05,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:05,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:05,231 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-12 21:39:05,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:39:05,232 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:05,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1157253741, now seen corresponding path program 1 times [2024-10-12 21:39:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501452892] [2024-10-12 21:39:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:05,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501452892] [2024-10-12 21:39:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501452892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:05,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278081171] [2024-10-12 21:39:05,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:05,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:05,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:05,342 INFO L87 Difference]: Start difference. First operand 6853 states and 10565 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-12 21:39:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:05,582 INFO L93 Difference]: Finished difference Result 15529 states and 23783 transitions. [2024-10-12 21:39:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:05,583 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-12 21:39:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:05,607 INFO L225 Difference]: With dead ends: 15529 [2024-10-12 21:39:05,608 INFO L226 Difference]: Without dead ends: 10999 [2024-10-12 21:39:05,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:05,619 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-12 21:39:05,619 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-12 21:39:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10999 states. [2024-10-12 21:39:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10999 to 10997. [2024-10-12 21:39:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10997 states, 10995 states have (on average 1.5226011823556163) internal successors, (16741), 10996 states have internal predecessors, (16741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10997 states to 10997 states and 16741 transitions. [2024-10-12 21:39:05,937 INFO L78 Accepts]: Start accepts. Automaton has 10997 states and 16741 transitions. Word has length 91 [2024-10-12 21:39:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:05,937 INFO L471 AbstractCegarLoop]: Abstraction has 10997 states and 16741 transitions. [2024-10-12 21:39:05,937 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-12 21:39:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 10997 states and 16741 transitions. [2024-10-12 21:39:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:05,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:05,939 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-12 21:39:05,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:39:05,939 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:05,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2045987181, now seen corresponding path program 1 times [2024-10-12 21:39:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:05,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763434335] [2024-10-12 21:39:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:06,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763434335] [2024-10-12 21:39:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763434335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:06,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607532503] [2024-10-12 21:39:06,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:06,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:06,016 INFO L87 Difference]: Start difference. First operand 10997 states and 16741 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-12 21:39:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:06,432 INFO L93 Difference]: Finished difference Result 27577 states and 41639 transitions. [2024-10-12 21:39:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:06,433 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-12 21:39:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:06,466 INFO L225 Difference]: With dead ends: 27577 [2024-10-12 21:39:06,466 INFO L226 Difference]: Without dead ends: 18903 [2024-10-12 21:39:06,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:06,479 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-12 21:39:06,479 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-12 21:39:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2024-10-12 21:39:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 18901. [2024-10-12 21:39:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18901 states, 18899 states have (on average 1.4987565479655007) internal successors, (28325), 18900 states have internal predecessors, (28325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18901 states to 18901 states and 28325 transitions. [2024-10-12 21:39:06,996 INFO L78 Accepts]: Start accepts. Automaton has 18901 states and 28325 transitions. Word has length 91 [2024-10-12 21:39:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:06,996 INFO L471 AbstractCegarLoop]: Abstraction has 18901 states and 28325 transitions. [2024-10-12 21:39:06,996 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-12 21:39:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18901 states and 28325 transitions. [2024-10-12 21:39:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:06,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:06,997 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-12 21:39:06,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:39:06,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:06,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1873031571, now seen corresponding path program 1 times [2024-10-12 21:39:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075542567] [2024-10-12 21:39:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075542567] [2024-10-12 21:39:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075542567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:07,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:07,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685920573] [2024-10-12 21:39:07,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:07,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:07,081 INFO L87 Difference]: Start difference. First operand 18901 states and 28325 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-12 21:39:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:07,742 INFO L93 Difference]: Finished difference Result 50521 states and 75047 transitions. [2024-10-12 21:39:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:07,742 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-12 21:39:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:07,803 INFO L225 Difference]: With dead ends: 50521 [2024-10-12 21:39:07,803 INFO L226 Difference]: Without dead ends: 33943 [2024-10-12 21:39:07,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:07,831 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-12 21:39:07,831 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-12 21:39:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33943 states. [2024-10-12 21:39:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33943 to 33941. [2024-10-12 21:39:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33941 states, 33939 states have (on average 1.471964406729721) internal successors, (49957), 33940 states have internal predecessors, (49957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33941 states to 33941 states and 49957 transitions. [2024-10-12 21:39:08,735 INFO L78 Accepts]: Start accepts. Automaton has 33941 states and 49957 transitions. Word has length 91 [2024-10-12 21:39:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:08,735 INFO L471 AbstractCegarLoop]: Abstraction has 33941 states and 49957 transitions. [2024-10-12 21:39:08,735 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-12 21:39:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 33941 states and 49957 transitions. [2024-10-12 21:39:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:08,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:08,743 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-12 21:39:08,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:39:08,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:08,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1900714775, now seen corresponding path program 1 times [2024-10-12 21:39:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073392090] [2024-10-12 21:39:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:09,055 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-12 21:39:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:09,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073392090] [2024-10-12 21:39:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073392090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495849639] [2024-10-12 21:39:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:09,060 INFO L87 Difference]: Start difference. First operand 33941 states and 49957 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-12 21:39:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:14,017 INFO L93 Difference]: Finished difference Result 283559 states and 415662 transitions. [2024-10-12 21:39:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:14,017 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-12 21:39:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:14,817 INFO L225 Difference]: With dead ends: 283559 [2024-10-12 21:39:14,817 INFO L226 Difference]: Without dead ends: 261541 [2024-10-12 21:39:14,928 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-12 21:39:14,933 INFO L432 NwaCegarLoop]: 1693 mSDtfsCounter, 11678 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 21:39:14,933 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-12 21:39:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261541 states. [2024-10-12 21:39:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261541 to 60821. [2024-10-12 21:39:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60821 states, 60819 states have (on average 1.4633091632549038) internal successors, (88997), 60820 states have internal predecessors, (88997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60821 states to 60821 states and 88997 transitions. [2024-10-12 21:39:18,571 INFO L78 Accepts]: Start accepts. Automaton has 60821 states and 88997 transitions. Word has length 115 [2024-10-12 21:39:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:18,572 INFO L471 AbstractCegarLoop]: Abstraction has 60821 states and 88997 transitions. [2024-10-12 21:39:18,572 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-12 21:39:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 60821 states and 88997 transitions. [2024-10-12 21:39:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:18,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:18,581 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-12 21:39:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:39:18,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:18,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1975327255, now seen corresponding path program 1 times [2024-10-12 21:39:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012786576] [2024-10-12 21:39:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:19,064 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-12 21:39:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012786576] [2024-10-12 21:39:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012786576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152035676] [2024-10-12 21:39:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:19,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:19,067 INFO L87 Difference]: Start difference. First operand 60821 states and 88997 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-12 21:39:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:25,200 INFO L93 Difference]: Finished difference Result 315175 states and 461742 transitions. [2024-10-12 21:39:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:25,200 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-12 21:39:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:25,660 INFO L225 Difference]: With dead ends: 315175 [2024-10-12 21:39:25,661 INFO L226 Difference]: Without dead ends: 283557 [2024-10-12 21:39:25,748 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-12 21:39:25,748 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11680 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:25,748 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.2s Time] [2024-10-12 21:39:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283557 states. [2024-10-12 21:39:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283557 to 103445. [2024-10-12 21:39:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103445 states, 103443 states have (on average 1.458010691878619) internal successors, (150821), 103444 states have internal predecessors, (150821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103445 states to 103445 states and 150821 transitions. [2024-10-12 21:39:30,815 INFO L78 Accepts]: Start accepts. Automaton has 103445 states and 150821 transitions. Word has length 115 [2024-10-12 21:39:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:30,816 INFO L471 AbstractCegarLoop]: Abstraction has 103445 states and 150821 transitions. [2024-10-12 21:39:30,816 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-12 21:39:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 103445 states and 150821 transitions. [2024-10-12 21:39:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:30,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:30,828 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-12 21:39:30,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:39:30,828 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:30,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1974642665, now seen corresponding path program 1 times [2024-10-12 21:39:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:30,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124855885] [2024-10-12 21:39:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:31,172 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-12 21:39:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124855885] [2024-10-12 21:39:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124855885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:31,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:31,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465044445] [2024-10-12 21:39:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:31,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:31,175 INFO L87 Difference]: Start difference. First operand 103445 states and 150821 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-12 21:39:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:38,849 INFO L93 Difference]: Finished difference Result 346791 states and 507694 transitions. [2024-10-12 21:39:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:38,849 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-12 21:39:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:39,398 INFO L225 Difference]: With dead ends: 346791 [2024-10-12 21:39:39,398 INFO L226 Difference]: Without dead ends: 315173 [2024-10-12 21:39:39,493 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-12 21:39:39,493 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 11722 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:39,494 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.2s Time] [2024-10-12 21:39:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315173 states. [2024-10-12 21:39:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315173 to 135061. [2024-10-12 21:39:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135061 states, 135059 states have (on average 1.456941040582264) internal successors, (196773), 135060 states have internal predecessors, (196773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135061 states to 135061 states and 196773 transitions. [2024-10-12 21:39:45,764 INFO L78 Accepts]: Start accepts. Automaton has 135061 states and 196773 transitions. Word has length 115 [2024-10-12 21:39:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:45,765 INFO L471 AbstractCegarLoop]: Abstraction has 135061 states and 196773 transitions. [2024-10-12 21:39:45,765 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-12 21:39:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 135061 states and 196773 transitions. [2024-10-12 21:39:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:45,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:45,776 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-12 21:39:45,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:39:45,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2051741463, now seen corresponding path program 1 times [2024-10-12 21:39:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565593028] [2024-10-12 21:39:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:46,043 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-12 21:39:46,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565593028] [2024-10-12 21:39:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565593028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:46,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:46,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713280945] [2024-10-12 21:39:46,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:46,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:46,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:46,046 INFO L87 Difference]: Start difference. First operand 135061 states and 196773 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)