./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label18.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d37cc054943fa8b1eb7628e7c1bb2a31caa49744b497c911cc2a7e740f8d544d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:57:44,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:57:44,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:57:44,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:57:44,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:57:44,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:57:44,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:57:44,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:57:44,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:57:44,229 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:57:44,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:57:44,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:57:44,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:57:44,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:57:44,231 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:57:44,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:57:44,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:57:44,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:57:44,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:57:44,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:57:44,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:57:44,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:57:44,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:57:44,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:57:44,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:57:44,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:57:44,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:57:44,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:57:44,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:57:44,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:57:44,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:57:44,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:57:44,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:57:44,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:57:44,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:57:44,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:57:44,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:57:44,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:57:44,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:57:44,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:57:44,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:57:44,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:57:44,253 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d37cc054943fa8b1eb7628e7c1bb2a31caa49744b497c911cc2a7e740f8d544d [2024-10-10 23:57:44,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:57:44,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:57:44,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:57:44,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:57:44,535 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:57:44,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label18.c [2024-10-10 23:57:46,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:57:46,613 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:57:46,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label18.c [2024-10-10 23:57:46,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a530c074c/79c1e1a00ebf43cb9cf32a97d7b6c4ab/FLAG0ee766c20 [2024-10-10 23:57:47,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a530c074c/79c1e1a00ebf43cb9cf32a97d7b6c4ab [2024-10-10 23:57:47,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:57:47,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:57:47,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:57:47,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:57:47,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:57:47,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:57:47" (1/1) ... [2024-10-10 23:57:47,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c869512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:47, skipping insertion in model container [2024-10-10 23:57:47,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:57:47" (1/1) ... [2024-10-10 23:57:47,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:57:47,606 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/eca-rers2012/Problem19_label18.c[4201,4214] [2024-10-10 23:57:48,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:57:48,884 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:57:48,900 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/eca-rers2012/Problem19_label18.c[4201,4214] [2024-10-10 23:57:49,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:57:49,597 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:57:49,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49 WrapperNode [2024-10-10 23:57:49,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:57:49,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:57:49,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:57:49,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:57:49,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:49,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:50,474 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-10 23:57:50,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:57:50,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:57:50,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:57:50,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:57:50,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:50,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:50,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:50,916 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-10 23:57:50,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:50,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:51,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:51,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:51,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:51,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:51,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:57:51,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:57:51,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:57:51,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:57:51,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (1/1) ... [2024-10-10 23:57:51,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:57:51,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:57:51,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:57:51,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:57:51,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:57:51,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:57:51,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:57:51,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:57:51,601 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:57:51,607 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:57:59,655 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-10 23:57:59,655 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:57:59,766 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:57:59,766 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:57:59,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:57:59 BoogieIcfgContainer [2024-10-10 23:57:59,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:57:59,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:57:59,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:57:59,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:57:59,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:57:47" (1/3) ... [2024-10-10 23:57:59,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c94137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:57:59, skipping insertion in model container [2024-10-10 23:57:59,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:57:49" (2/3) ... [2024-10-10 23:57:59,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c94137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:57:59, skipping insertion in model container [2024-10-10 23:57:59,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:57:59" (3/3) ... [2024-10-10 23:57:59,776 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label18.c [2024-10-10 23:57:59,792 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:57:59,793 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:57:59,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:57:59,913 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;@77dda0d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:57:59,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:57:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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-10 23:57:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 23:57:59,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:57:59,930 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] [2024-10-10 23:57:59,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:57:59,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:57:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash -868443178, now seen corresponding path program 1 times [2024-10-10 23:57:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:57:59,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495370987] [2024-10-10 23:57:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:57:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:00,116 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-10 23:58:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495370987] [2024-10-10 23:58:00,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495370987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:00,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:00,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447023130] [2024-10-10 23:58:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:00,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:58:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:00,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:58:00,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:58:00,156 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-10 23:58:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:00,273 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-10 23:58:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:58:00,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-10 23:58:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:00,298 INFO L225 Difference]: With dead ends: 3371 [2024-10-10 23:58:00,300 INFO L226 Difference]: Without dead ends: 1684 [2024-10-10 23:58:00,308 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-10 23:58:00,312 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:00,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:58:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-10 23:58:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-10 23:58:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 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-10 23:58:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-10 23:58:00,433 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 29 [2024-10-10 23:58:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:00,434 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-10 23:58:00,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-10 23:58:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-10 23:58:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 23:58:00,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:00,436 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] [2024-10-10 23:58:00,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:58:00,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -903288781, now seen corresponding path program 1 times [2024-10-10 23:58:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523033680] [2024-10-10 23:58:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:00,624 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-10 23:58:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523033680] [2024-10-10 23:58:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523033680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703445827] [2024-10-10 23:58:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:00,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:00,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:00,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:00,630 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-10 23:58:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:06,737 INFO L93 Difference]: Finished difference Result 4789 states and 8995 transitions. [2024-10-10 23:58:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:06,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-10 23:58:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:06,751 INFO L225 Difference]: With dead ends: 4789 [2024-10-10 23:58:06,752 INFO L226 Difference]: Without dead ends: 3106 [2024-10-10 23:58:06,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:06,758 INFO L432 NwaCegarLoop]: 1212 mSDtfsCounter, 1519 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4579 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 5629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:06,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1390 Invalid, 5629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4579 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-10 23:58:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2024-10-10 23:58:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3105. [2024-10-10 23:58:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.653028350515464) internal successors, (5131), 3104 states have internal predecessors, (5131), 0 states have call successors, (0), 0 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-10 23:58:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5131 transitions. [2024-10-10 23:58:06,833 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5131 transitions. Word has length 29 [2024-10-10 23:58:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:06,833 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5131 transitions. [2024-10-10 23:58:06,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-10 23:58:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5131 transitions. [2024-10-10 23:58:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-10 23:58:06,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:06,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:58:06,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:58:06,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:06,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1452236601, now seen corresponding path program 1 times [2024-10-10 23:58:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:06,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671928538] [2024-10-10 23:58:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671928538] [2024-10-10 23:58:07,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671928538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:07,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:07,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:58:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814753006] [2024-10-10 23:58:07,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:07,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:58:07,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:07,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:58:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:58:07,237 INFO L87 Difference]: Start difference. First operand 3105 states and 5131 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-10 23:58:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:17,867 INFO L93 Difference]: Finished difference Result 10390 states and 16942 transitions. [2024-10-10 23:58:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:58:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-10-10 23:58:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:17,898 INFO L225 Difference]: With dead ends: 10390 [2024-10-10 23:58:17,898 INFO L226 Difference]: Without dead ends: 7286 [2024-10-10 23:58:17,907 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-10 23:58:17,909 INFO L432 NwaCegarLoop]: 1840 mSDtfsCounter, 4207 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 11123 mSolverCounterSat, 1405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4207 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 12528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1405 IncrementalHoareTripleChecker+Valid, 11123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:17,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4207 Valid, 2102 Invalid, 12528 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1405 Valid, 11123 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-10-10 23:58:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2024-10-10 23:58:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 7235. [2024-10-10 23:58:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7235 states, 7234 states have (on average 1.52156483273431) internal successors, (11007), 7234 states have internal predecessors, (11007), 0 states have call successors, (0), 0 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-10 23:58:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 11007 transitions. [2024-10-10 23:58:18,101 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 11007 transitions. Word has length 98 [2024-10-10 23:58:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:18,102 INFO L471 AbstractCegarLoop]: Abstraction has 7235 states and 11007 transitions. [2024-10-10 23:58:18,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-10 23:58:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 11007 transitions. [2024-10-10 23:58:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-10 23:58:18,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:18,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:58:18,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:58:18,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:18,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:18,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1744480998, now seen corresponding path program 1 times [2024-10-10 23:58:18,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099071223] [2024-10-10 23:58:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099071223] [2024-10-10 23:58:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099071223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:19,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:58:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612907053] [2024-10-10 23:58:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:58:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:58:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:58:19,014 INFO L87 Difference]: Start difference. First operand 7235 states and 11007 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-10 23:58:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:24,112 INFO L93 Difference]: Finished difference Result 13135 states and 20667 transitions. [2024-10-10 23:58:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:58:24,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2024-10-10 23:58:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:24,137 INFO L225 Difference]: With dead ends: 13135 [2024-10-10 23:58:24,138 INFO L226 Difference]: Without dead ends: 7235 [2024-10-10 23:58:24,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:58:24,151 INFO L432 NwaCegarLoop]: 1765 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5713 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 5721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:24,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1943 Invalid, 5721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5713 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-10 23:58:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7235 states. [2024-10-10 23:58:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7235 to 7235. [2024-10-10 23:58:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7235 states, 7234 states have (on average 1.5203207077688692) internal successors, (10998), 7234 states have internal predecessors, (10998), 0 states have call successors, (0), 0 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-10 23:58:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 10998 transitions. [2024-10-10 23:58:24,315 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 10998 transitions. Word has length 264 [2024-10-10 23:58:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:24,317 INFO L471 AbstractCegarLoop]: Abstraction has 7235 states and 10998 transitions. [2024-10-10 23:58:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-10 23:58:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 10998 transitions. [2024-10-10 23:58:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2024-10-10 23:58:24,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:24,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:58:24,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:58:24,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash 285588354, now seen corresponding path program 1 times [2024-10-10 23:58:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397262205] [2024-10-10 23:58:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-10 23:58:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:25,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397262205] [2024-10-10 23:58:25,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397262205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:25,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:25,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419358229] [2024-10-10 23:58:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:25,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:25,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:25,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:25,114 INFO L87 Difference]: Start difference. First operand 7235 states and 10998 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 2 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-10 23:58:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:29,947 INFO L93 Difference]: Finished difference Result 15841 states and 24471 transitions. [2024-10-10 23:58:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:29,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 2 states have internal predecessors, (509), 0 states have call successors, (0), 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 581 [2024-10-10 23:58:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:29,979 INFO L225 Difference]: With dead ends: 15841 [2024-10-10 23:58:29,979 INFO L226 Difference]: Without dead ends: 9972 [2024-10-10 23:58:29,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:29,987 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 1396 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:29,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 752 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-10 23:58:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9972 states. [2024-10-10 23:58:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9972 to 9968. [2024-10-10 23:58:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.3901876191431726) internal successors, (13856), 9967 states have internal predecessors, (13856), 0 states have call successors, (0), 0 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-10 23:58:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 13856 transitions. [2024-10-10 23:58:30,171 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 13856 transitions. Word has length 581 [2024-10-10 23:58:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:30,172 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 13856 transitions. [2024-10-10 23:58:30,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 2 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-10 23:58:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 13856 transitions. [2024-10-10 23:58:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2024-10-10 23:58:30,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:30,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:58:30,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:58:30,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:30,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash 120723355, now seen corresponding path program 1 times [2024-10-10 23:58:30,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:30,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848649641] [2024-10-10 23:58:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-10 23:58:30,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:30,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848649641] [2024-10-10 23:58:30,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848649641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990124682] [2024-10-10 23:58:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:30,744 INFO L87 Difference]: Start difference. First operand 9968 states and 13856 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 2 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-10 23:58:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:36,411 INFO L93 Difference]: Finished difference Result 26932 states and 38506 transitions. [2024-10-10 23:58:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:36,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 2 states have internal predecessors, (509), 0 states have call successors, (0), 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 584 [2024-10-10 23:58:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:36,446 INFO L225 Difference]: With dead ends: 26932 [2024-10-10 23:58:36,447 INFO L226 Difference]: Without dead ends: 18330 [2024-10-10 23:58:36,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:36,459 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 2119 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5114 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 5548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:36,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 980 Invalid, 5548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5114 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-10 23:58:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18330 states. [2024-10-10 23:58:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18330 to 18328. [2024-10-10 23:58:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18328 states, 18327 states have (on average 1.378621705680144) internal successors, (25266), 18327 states have internal predecessors, (25266), 0 states have call successors, (0), 0 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-10 23:58:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18328 states to 18328 states and 25266 transitions. [2024-10-10 23:58:36,776 INFO L78 Accepts]: Start accepts. Automaton has 18328 states and 25266 transitions. Word has length 584 [2024-10-10 23:58:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:36,777 INFO L471 AbstractCegarLoop]: Abstraction has 18328 states and 25266 transitions. [2024-10-10 23:58:36,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 2 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-10 23:58:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 18328 states and 25266 transitions. [2024-10-10 23:58:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2024-10-10 23:58:36,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:36,791 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:58:36,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:58:36,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:36,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash 58568522, now seen corresponding path program 1 times [2024-10-10 23:58:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:36,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260715310] [2024-10-10 23:58:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:36,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:37,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:37,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260715310] [2024-10-10 23:58:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260715310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:37,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:37,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:58:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492793705] [2024-10-10 23:58:37,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:37,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:37,350 INFO L87 Difference]: Start difference. First operand 18328 states and 25266 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 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-10 23:58:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:43,064 INFO L93 Difference]: Finished difference Result 43576 states and 60753 transitions. [2024-10-10 23:58:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:43,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 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 598 [2024-10-10 23:58:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:43,116 INFO L225 Difference]: With dead ends: 43576 [2024-10-10 23:58:43,116 INFO L226 Difference]: Without dead ends: 26614 [2024-10-10 23:58:43,135 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-10 23:58:43,136 INFO L432 NwaCegarLoop]: 3096 mSDtfsCounter, 1385 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5007 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 5914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 5007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:43,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 3268 Invalid, 5914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 5007 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-10 23:58:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26614 states. [2024-10-10 23:58:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26614 to 26553. [2024-10-10 23:58:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26553 states, 26552 states have (on average 1.3131214221150949) internal successors, (34866), 26552 states have internal predecessors, (34866), 0 states have call successors, (0), 0 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-10 23:58:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26553 states to 26553 states and 34866 transitions. [2024-10-10 23:58:43,471 INFO L78 Accepts]: Start accepts. Automaton has 26553 states and 34866 transitions. Word has length 598 [2024-10-10 23:58:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:43,473 INFO L471 AbstractCegarLoop]: Abstraction has 26553 states and 34866 transitions. [2024-10-10 23:58:43,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 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-10 23:58:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 26553 states and 34866 transitions. [2024-10-10 23:58:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2024-10-10 23:58:43,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:43,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:58:43,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:58:43,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:43,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -298498292, now seen corresponding path program 1 times [2024-10-10 23:58:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:43,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928734389] [2024-10-10 23:58:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:58:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928734389] [2024-10-10 23:58:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928734389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:44,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620932156] [2024-10-10 23:58:44,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:44,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:44,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:44,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:44,040 INFO L87 Difference]: Start difference. First operand 26553 states and 34866 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-10 23:58:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:49,782 INFO L93 Difference]: Finished difference Result 76526 states and 101361 transitions. [2024-10-10 23:58:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:49,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 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 607 [2024-10-10 23:58:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:49,871 INFO L225 Difference]: With dead ends: 76526 [2024-10-10 23:58:49,871 INFO L226 Difference]: Without dead ends: 51339 [2024-10-10 23:58:49,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:49,895 INFO L432 NwaCegarLoop]: 1778 mSDtfsCounter, 1351 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 4299 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 5729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:49,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 2047 Invalid, 5729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4299 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-10 23:58:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51339 states. [2024-10-10 23:58:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51339 to 51318. [2024-10-10 23:58:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51318 states, 51317 states have (on average 1.202739832803944) internal successors, (61721), 51317 states have internal predecessors, (61721), 0 states have call successors, (0), 0 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-10 23:58:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51318 states to 51318 states and 61721 transitions. [2024-10-10 23:58:50,449 INFO L78 Accepts]: Start accepts. Automaton has 51318 states and 61721 transitions. Word has length 607 [2024-10-10 23:58:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:50,451 INFO L471 AbstractCegarLoop]: Abstraction has 51318 states and 61721 transitions. [2024-10-10 23:58:50,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-10 23:58:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 51318 states and 61721 transitions. [2024-10-10 23:58:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2024-10-10 23:58:50,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:50,456 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:58:50,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:58:50,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:50,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -512944409, now seen corresponding path program 1 times [2024-10-10 23:58:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747702705] [2024-10-10 23:58:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:51,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:51,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747702705] [2024-10-10 23:58:51,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747702705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:51,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:51,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:58:51,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396338945] [2024-10-10 23:58:51,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:51,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:58:51,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:51,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:58:51,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:58:51,686 INFO L87 Difference]: Start difference. First operand 51318 states and 61721 transitions. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 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-10 23:58:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:59,075 INFO L93 Difference]: Finished difference Result 110862 states and 132168 transitions. [2024-10-10 23:58:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:58:59,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 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 620 [2024-10-10 23:58:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:59,177 INFO L225 Difference]: With dead ends: 110862 [2024-10-10 23:58:59,177 INFO L226 Difference]: Without dead ends: 60884 [2024-10-10 23:58:59,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:58:59,220 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 2170 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 10259 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 10425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 10259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:59,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2022 Invalid, 10425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 10259 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-10-10 23:58:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60884 states. [2024-10-10 23:58:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60884 to 59514. [2024-10-10 23:58:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59514 states, 59513 states have (on average 1.1797422411910004) internal successors, (70210), 59513 states have internal predecessors, (70210), 0 states have call successors, (0), 0 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-10 23:58:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59514 states to 59514 states and 70210 transitions. [2024-10-10 23:58:59,848 INFO L78 Accepts]: Start accepts. Automaton has 59514 states and 70210 transitions. Word has length 620 [2024-10-10 23:58:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:59,848 INFO L471 AbstractCegarLoop]: Abstraction has 59514 states and 70210 transitions. [2024-10-10 23:58:59,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 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-10 23:58:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 59514 states and 70210 transitions. [2024-10-10 23:58:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2024-10-10 23:58:59,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:59,857 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:58:59,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:58:59,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1998876317, now seen corresponding path program 1 times [2024-10-10 23:58:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727391516] [2024-10-10 23:58:59,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:59,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-10 23:59:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:00,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727391516] [2024-10-10 23:59:00,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727391516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:00,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:00,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:59:00,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877074098] [2024-10-10 23:59:00,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:00,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:59:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:00,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:59:00,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:00,528 INFO L87 Difference]: Start difference. First operand 59514 states and 70210 transitions. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)