./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 339d0df57823aa1bea53354295970ed66e6abc60d457d19cd7cfd0d27ddbb8a9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:20:49,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:20:49,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:20:49,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:20:49,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:20:49,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:20:49,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:20:49,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:20:49,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:20:49,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:20:49,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:20:49,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:20:49,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:20:49,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:20:49,304 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:20:49,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:20:49,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:20:49,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:20:49,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:20:49,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:20:49,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:20:49,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:20:49,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:20:49,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:20:49,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:20:49,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:20:49,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:20:49,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:20:49,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:20:49,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:20:49,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:20:49,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:20:49,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:49,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:20:49,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:20:49,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:20:49,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:20:49,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:20:49,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:20:49,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:20:49,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:20:49,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:20:49,312 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 339d0df57823aa1bea53354295970ed66e6abc60d457d19cd7cfd0d27ddbb8a9 [2024-11-09 19:20:49,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:20:49,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:20:49,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:20:49,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:20:49,531 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:20:49,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label01.c [2024-11-09 19:20:50,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:20:51,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:20:51,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label01.c [2024-11-09 19:20:51,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451f737de/04389819c4db479ba650bbc737525003/FLAGd5d0d3f55 [2024-11-09 19:20:51,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451f737de/04389819c4db479ba650bbc737525003 [2024-11-09 19:20:51,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:20:51,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:20:51,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:51,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:20:51,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:20:51,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:51" (1/1) ... [2024-11-09 19:20:51,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56facccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:51, skipping insertion in model container [2024-11-09 19:20:51,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:51" (1/1) ... [2024-11-09 19:20:51,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:20:51,873 WARN L250 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/Problem11_label01.c[8261,8274] [2024-11-09 19:20:52,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:52,023 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:20:52,051 WARN L250 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/Problem11_label01.c[8261,8274] [2024-11-09 19:20:52,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:52,167 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:20:52,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52 WrapperNode [2024-11-09 19:20:52,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:52,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:52,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:20:52,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:20:52,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,286 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:20:52,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:52,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:20:52,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:20:52,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:20:52,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,413 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-11-09 19:20:52,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:20:52,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:20:52,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:20:52,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:20:52,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (1/1) ... [2024-11-09 19:20:52,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:52,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:52,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:20:52,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:20:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:20:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:20:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:20:52,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:20:52,626 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:20:52,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:20:54,451 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:20:54,452 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:20:54,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:20:54,465 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:20:54,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:54 BoogieIcfgContainer [2024-11-09 19:20:54,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:20:54,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:20:54,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:20:54,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:20:54,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:20:51" (1/3) ... [2024-11-09 19:20:54,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4468954c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:54, skipping insertion in model container [2024-11-09 19:20:54,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:52" (2/3) ... [2024-11-09 19:20:54,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4468954c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:54, skipping insertion in model container [2024-11-09 19:20:54,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:54" (3/3) ... [2024-11-09 19:20:54,471 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label01.c [2024-11-09 19:20:54,483 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:20:54,484 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:20:54,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:20:54,554 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;@14762f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:20:54,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:20:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 19:20:54,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:54,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:54,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:54,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1202426749, now seen corresponding path program 1 times [2024-11-09 19:20:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834021921] [2024-11-09 19:20:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834021921] [2024-11-09 19:20:54,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834021921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:54,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387210025] [2024-11-09 19:20:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:54,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:54,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:54,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:54,988 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 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 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:56,097 INFO L93 Difference]: Finished difference Result 767 states and 1708 transitions. [2024-11-09 19:20:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:56,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-09 19:20:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:56,110 INFO L225 Difference]: With dead ends: 767 [2024-11-09 19:20:56,111 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:20:56,114 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-11-09 19:20:56,116 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 290 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:56,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 227 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:20:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:20:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 19:20:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.0240963855421685) internal successors, (840), 415 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 840 transitions. [2024-11-09 19:20:56,165 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 840 transitions. Word has length 59 [2024-11-09 19:20:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:56,169 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 840 transitions. [2024-11-09 19:20:56,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 840 transitions. [2024-11-09 19:20:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 19:20:56,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:56,176 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, 2, 2, 2, 2, 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] [2024-11-09 19:20:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:20:56,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 490236058, now seen corresponding path program 1 times [2024-11-09 19:20:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120595250] [2024-11-09 19:20:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120595250] [2024-11-09 19:20:56,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120595250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:56,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:56,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199400755] [2024-11-09 19:20:56,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:56,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:56,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:56,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:56,357 INFO L87 Difference]: Start difference. First operand 416 states and 840 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:57,185 INFO L93 Difference]: Finished difference Result 1219 states and 2485 transitions. [2024-11-09 19:20:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:57,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-09 19:20:57,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:57,189 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 19:20:57,189 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:20:57,191 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-11-09 19:20:57,191 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:57,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 125 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:20:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:20:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2024-11-09 19:20:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9722572509457756) internal successors, (1564), 793 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1564 transitions. [2024-11-09 19:20:57,219 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1564 transitions. Word has length 128 [2024-11-09 19:20:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:57,220 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1564 transitions. [2024-11-09 19:20:57,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1564 transitions. [2024-11-09 19:20:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 19:20:57,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:57,222 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, 2, 2, 2, 2, 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] [2024-11-09 19:20:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:20:57,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:57,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1276189728, now seen corresponding path program 1 times [2024-11-09 19:20:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:57,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139182990] [2024-11-09 19:20:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:57,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:57,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139182990] [2024-11-09 19:20:57,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139182990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:57,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:57,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135162908] [2024-11-09 19:20:57,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:57,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:57,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:57,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:57,553 INFO L87 Difference]: Start difference. First operand 794 states and 1564 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:58,373 INFO L93 Difference]: Finished difference Result 2331 states and 4625 transitions. [2024-11-09 19:20:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:58,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-09 19:20:58,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:58,378 INFO L225 Difference]: With dead ends: 2331 [2024-11-09 19:20:58,378 INFO L226 Difference]: Without dead ends: 1539 [2024-11-09 19:20:58,380 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-11-09 19:20:58,381 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 241 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:58,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 199 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:20:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-09 19:20:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1535. [2024-11-09 19:20:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.8370273794002607) internal successors, (2818), 1534 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2818 transitions. [2024-11-09 19:20:58,441 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2818 transitions. Word has length 130 [2024-11-09 19:20:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:58,441 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2818 transitions. [2024-11-09 19:20:58,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2818 transitions. [2024-11-09 19:20:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-09 19:20:58,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:58,447 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, 2, 2, 2, 2, 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] [2024-11-09 19:20:58,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:20:58,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:58,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash 200819319, now seen corresponding path program 1 times [2024-11-09 19:20:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963524869] [2024-11-09 19:20:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963524869] [2024-11-09 19:20:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963524869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806607299] [2024-11-09 19:20:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:58,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:58,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:58,660 INFO L87 Difference]: Start difference. First operand 1535 states and 2818 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:59,425 INFO L93 Difference]: Finished difference Result 3276 states and 6167 transitions. [2024-11-09 19:20:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2024-11-09 19:20:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:59,432 INFO L225 Difference]: With dead ends: 3276 [2024-11-09 19:20:59,432 INFO L226 Difference]: Without dead ends: 1928 [2024-11-09 19:20:59,434 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-11-09 19:20:59,435 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 297 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:59,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 446 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:20:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-09 19:20:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-09 19:20:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.863825363825364) internal successors, (3586), 1924 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3586 transitions. [2024-11-09 19:20:59,514 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3586 transitions. Word has length 187 [2024-11-09 19:20:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:59,515 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3586 transitions. [2024-11-09 19:20:59,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3586 transitions. [2024-11-09 19:20:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 19:20:59,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:59,520 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:20:59,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:20:59,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:59,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash -771803045, now seen corresponding path program 1 times [2024-11-09 19:20:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920951985] [2024-11-09 19:20:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:20:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:59,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920951985] [2024-11-09 19:20:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920951985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321041530] [2024-11-09 19:20:59,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:59,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:59,744 INFO L87 Difference]: Start difference. First operand 1925 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:00,630 INFO L93 Difference]: Finished difference Result 4774 states and 9094 transitions. [2024-11-09 19:21:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:00,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 243 [2024-11-09 19:21:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:00,640 INFO L225 Difference]: With dead ends: 4774 [2024-11-09 19:21:00,641 INFO L226 Difference]: Without dead ends: 3036 [2024-11-09 19:21:00,643 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-11-09 19:21:00,643 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 269 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:00,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 470 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2024-11-09 19:21:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 3036. [2024-11-09 19:21:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 1.8457990115321252) internal successors, (5602), 3035 states have internal predecessors, (5602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 5602 transitions. [2024-11-09 19:21:00,699 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 5602 transitions. Word has length 243 [2024-11-09 19:21:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:00,701 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 5602 transitions. [2024-11-09 19:21:00,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 5602 transitions. [2024-11-09 19:21:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-09 19:21:00,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:00,705 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:21:00,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:21:00,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:00,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash 80038573, now seen corresponding path program 1 times [2024-11-09 19:21:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:00,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461354857] [2024-11-09 19:21:00,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 84 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461354857] [2024-11-09 19:21:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461354857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544159638] [2024-11-09 19:21:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:01,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:01,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:21:01,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:21:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:01,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:21:01,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:01,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:21:01,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544159638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:01,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:21:01,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:21:01,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813784823] [2024-11-09 19:21:01,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:01,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:01,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:01,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:01,341 INFO L87 Difference]: Start difference. First operand 3036 states and 5602 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:02,170 INFO L93 Difference]: Finished difference Result 6816 states and 12776 transitions. [2024-11-09 19:21:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 249 [2024-11-09 19:21:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:02,182 INFO L225 Difference]: With dead ends: 6816 [2024-11-09 19:21:02,182 INFO L226 Difference]: Without dead ends: 3967 [2024-11-09 19:21:02,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:02,186 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 292 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:02,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 395 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2024-11-09 19:21:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3964. [2024-11-09 19:21:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3963 states have (on average 1.8614685844057532) internal successors, (7377), 3963 states have internal predecessors, (7377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 7377 transitions. [2024-11-09 19:21:02,240 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 7377 transitions. Word has length 249 [2024-11-09 19:21:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 3964 states and 7377 transitions. [2024-11-09 19:21:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 7377 transitions. [2024-11-09 19:21:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-09 19:21:02,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:02,245 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:02,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:21:02,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:21:02,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash 786834353, now seen corresponding path program 1 times [2024-11-09 19:21:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694402436] [2024-11-09 19:21:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:21:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694402436] [2024-11-09 19:21:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694402436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:02,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:02,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498943675] [2024-11-09 19:21:02,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:02,676 INFO L87 Difference]: Start difference. First operand 3964 states and 7377 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:03,505 INFO L93 Difference]: Finished difference Result 9229 states and 17324 transitions. [2024-11-09 19:21:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 299 [2024-11-09 19:21:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:03,521 INFO L225 Difference]: With dead ends: 9229 [2024-11-09 19:21:03,521 INFO L226 Difference]: Without dead ends: 5452 [2024-11-09 19:21:03,525 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-11-09 19:21:03,526 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 259 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:03,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 507 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2024-11-09 19:21:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5443. [2024-11-09 19:21:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 5442 states have (on average 1.8384785005512678) internal successors, (10005), 5442 states have internal predecessors, (10005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 10005 transitions. [2024-11-09 19:21:03,600 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 10005 transitions. Word has length 299 [2024-11-09 19:21:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 5443 states and 10005 transitions. [2024-11-09 19:21:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 10005 transitions. [2024-11-09 19:21:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-09 19:21:03,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:03,606 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:21:03,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:21:03,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:03,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1138041783, now seen corresponding path program 1 times [2024-11-09 19:21:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:03,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274947291] [2024-11-09 19:21:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:21:03,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274947291] [2024-11-09 19:21:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274947291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319041932] [2024-11-09 19:21:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:03,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:03,834 INFO L87 Difference]: Start difference. First operand 5443 states and 10005 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:04,599 INFO L93 Difference]: Finished difference Result 12007 states and 22281 transitions. [2024-11-09 19:21:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:04,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 335 [2024-11-09 19:21:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:04,623 INFO L225 Difference]: With dead ends: 12007 [2024-11-09 19:21:04,626 INFO L226 Difference]: Without dead ends: 6751 [2024-11-09 19:21:04,631 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-11-09 19:21:04,632 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 267 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:04,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 459 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2024-11-09 19:21:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 6368. [2024-11-09 19:21:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6368 states, 6367 states have (on average 1.832574210774305) internal successors, (11668), 6367 states have internal predecessors, (11668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6368 states to 6368 states and 11668 transitions. [2024-11-09 19:21:04,789 INFO L78 Accepts]: Start accepts. Automaton has 6368 states and 11668 transitions. Word has length 335 [2024-11-09 19:21:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:04,789 INFO L471 AbstractCegarLoop]: Abstraction has 6368 states and 11668 transitions. [2024-11-09 19:21:04,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6368 states and 11668 transitions. [2024-11-09 19:21:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-09 19:21:04,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:04,799 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, 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, 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, 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] [2024-11-09 19:21:04,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:21:04,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:04,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1052176114, now seen corresponding path program 1 times [2024-11-09 19:21:04,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:04,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361594974] [2024-11-09 19:21:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:04,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 19:21:04,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:04,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361594974] [2024-11-09 19:21:04,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361594974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:04,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:04,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435975205] [2024-11-09 19:21:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:04,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:04,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:04,960 INFO L87 Difference]: Start difference. First operand 6368 states and 11668 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:05,671 INFO L93 Difference]: Finished difference Result 12710 states and 23300 transitions. [2024-11-09 19:21:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:05,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 345 [2024-11-09 19:21:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:05,680 INFO L225 Difference]: With dead ends: 12710 [2024-11-09 19:21:05,680 INFO L226 Difference]: Without dead ends: 6344 [2024-11-09 19:21:05,685 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-11-09 19:21:05,685 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 279 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:05,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 152 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6344 states. [2024-11-09 19:21:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6344 to 5417. [2024-11-09 19:21:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5417 states, 5416 states have (on average 1.7802806499261448) internal successors, (9642), 5416 states have internal predecessors, (9642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 9642 transitions. [2024-11-09 19:21:05,829 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 9642 transitions. Word has length 345 [2024-11-09 19:21:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:05,829 INFO L471 AbstractCegarLoop]: Abstraction has 5417 states and 9642 transitions. [2024-11-09 19:21:05,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 9642 transitions. [2024-11-09 19:21:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-09 19:21:05,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:05,838 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:21:05,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash -840511297, now seen corresponding path program 1 times [2024-11-09 19:21:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34727654] [2024-11-09 19:21:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:21:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34727654] [2024-11-09 19:21:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34727654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072686988] [2024-11-09 19:21:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:06,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:06,082 INFO L87 Difference]: Start difference. First operand 5417 states and 9642 transitions. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:07,373 INFO L93 Difference]: Finished difference Result 16036 states and 28582 transitions. [2024-11-09 19:21:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 434 [2024-11-09 19:21:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:07,389 INFO L225 Difference]: With dead ends: 16036 [2024-11-09 19:21:07,389 INFO L226 Difference]: Without dead ends: 10621 [2024-11-09 19:21:07,394 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-11-09 19:21:07,395 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 464 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:07,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 91 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:21:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2024-11-09 19:21:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 10619. [2024-11-09 19:21:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10619 states, 10618 states have (on average 1.7768883028818987) internal successors, (18867), 10618 states have internal predecessors, (18867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10619 states to 10619 states and 18867 transitions. [2024-11-09 19:21:07,500 INFO L78 Accepts]: Start accepts. Automaton has 10619 states and 18867 transitions. Word has length 434 [2024-11-09 19:21:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:07,500 INFO L471 AbstractCegarLoop]: Abstraction has 10619 states and 18867 transitions. [2024-11-09 19:21:07,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10619 states and 18867 transitions. [2024-11-09 19:21:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-11-09 19:21:07,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:07,513 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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-11-09 19:21:07,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:21:07,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:07,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash 541018241, now seen corresponding path program 1 times [2024-11-09 19:21:07,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:07,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266322988] [2024-11-09 19:21:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-11-09 19:21:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266322988] [2024-11-09 19:21:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266322988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:07,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374137236] [2024-11-09 19:21:07,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:07,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:07,791 INFO L87 Difference]: Start difference. First operand 10619 states and 18867 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:08,599 INFO L93 Difference]: Finished difference Result 22341 states and 39814 transitions. [2024-11-09 19:21:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:08,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 488 [2024-11-09 19:21:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:08,618 INFO L225 Difference]: With dead ends: 22341 [2024-11-09 19:21:08,618 INFO L226 Difference]: Without dead ends: 12468 [2024-11-09 19:21:08,626 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-11-09 19:21:08,627 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 184 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:08,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 486 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12468 states. [2024-11-09 19:21:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12468 to 12098. [2024-11-09 19:21:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12098 states, 12097 states have (on average 1.7800281061420187) internal successors, (21533), 12097 states have internal predecessors, (21533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12098 states to 12098 states and 21533 transitions. [2024-11-09 19:21:08,751 INFO L78 Accepts]: Start accepts. Automaton has 12098 states and 21533 transitions. Word has length 488 [2024-11-09 19:21:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:08,752 INFO L471 AbstractCegarLoop]: Abstraction has 12098 states and 21533 transitions. [2024-11-09 19:21:08,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 12098 states and 21533 transitions. [2024-11-09 19:21:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2024-11-09 19:21:08,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:08,767 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2024-11-09 19:21:08,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:21:08,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:08,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 100270836, now seen corresponding path program 1 times [2024-11-09 19:21:08,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:08,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460822967] [2024-11-09 19:21:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:08,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 527 proven. 24 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-09 19:21:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:09,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460822967] [2024-11-09 19:21:09,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460822967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946974252] [2024-11-09 19:21:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:09,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:09,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:09,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:21:09,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:21:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:09,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:21:09,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-09 19:21:09,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:21:09,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946974252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:09,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:21:09,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:21:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687706081] [2024-11-09 19:21:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:09,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:09,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:21:09,878 INFO L87 Difference]: Start difference. First operand 12098 states and 21533 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:10,697 INFO L93 Difference]: Finished difference Result 25317 states and 45115 transitions. [2024-11-09 19:21:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 522 [2024-11-09 19:21:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:10,722 INFO L225 Difference]: With dead ends: 25317 [2024-11-09 19:21:10,722 INFO L226 Difference]: Without dead ends: 14150 [2024-11-09 19:21:10,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:21:10,732 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 209 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:10,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 86 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2024-11-09 19:21:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 12283. [2024-11-09 19:21:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12283 states, 12282 states have (on average 1.7808174564403192) internal successors, (21872), 12282 states have internal predecessors, (21872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12283 states to 12283 states and 21872 transitions. [2024-11-09 19:21:10,945 INFO L78 Accepts]: Start accepts. Automaton has 12283 states and 21872 transitions. Word has length 522 [2024-11-09 19:21:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:10,945 INFO L471 AbstractCegarLoop]: Abstraction has 12283 states and 21872 transitions. [2024-11-09 19:21:10,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12283 states and 21872 transitions. [2024-11-09 19:21:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2024-11-09 19:21:10,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:10,970 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2024-11-09 19:21:10,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:21:11,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 19:21:11,171 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 303990675, now seen corresponding path program 1 times [2024-11-09 19:21:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812753702] [2024-11-09 19:21:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-09 19:21:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812753702] [2024-11-09 19:21:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812753702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235300560] [2024-11-09 19:21:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:11,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:11,585 INFO L87 Difference]: Start difference. First operand 12283 states and 21872 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:12,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:12,475 INFO L93 Difference]: Finished difference Result 27728 states and 49453 transitions. [2024-11-09 19:21:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:12,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 523 [2024-11-09 19:21:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:12,497 INFO L225 Difference]: With dead ends: 27728 [2024-11-09 19:21:12,498 INFO L226 Difference]: Without dead ends: 16376 [2024-11-09 19:21:12,510 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-11-09 19:21:12,512 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 261 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:12,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 133 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16376 states. [2024-11-09 19:21:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16376 to 16004. [2024-11-09 19:21:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16004 states, 16003 states have (on average 1.767168655877023) internal successors, (28280), 16003 states have internal predecessors, (28280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16004 states to 16004 states and 28280 transitions. [2024-11-09 19:21:12,866 INFO L78 Accepts]: Start accepts. Automaton has 16004 states and 28280 transitions. Word has length 523 [2024-11-09 19:21:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:12,867 INFO L471 AbstractCegarLoop]: Abstraction has 16004 states and 28280 transitions. [2024-11-09 19:21:12,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 16004 states and 28280 transitions. [2024-11-09 19:21:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2024-11-09 19:21:12,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:12,883 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:12,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:21:12,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:12,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1825548853, now seen corresponding path program 1 times [2024-11-09 19:21:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140543833] [2024-11-09 19:21:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 709 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-09 19:21:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140543833] [2024-11-09 19:21:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140543833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659255995] [2024-11-09 19:21:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:13,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:13,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:13,539 INFO L87 Difference]: Start difference. First operand 16004 states and 28280 transitions. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:14,904 INFO L93 Difference]: Finished difference Result 36090 states and 63810 transitions. [2024-11-09 19:21:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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 533 [2024-11-09 19:21:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:14,930 INFO L225 Difference]: With dead ends: 36090 [2024-11-09 19:21:14,930 INFO L226 Difference]: Without dead ends: 21202 [2024-11-09 19:21:14,946 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-11-09 19:21:14,946 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 494 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:14,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 82 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:21:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21202 states. [2024-11-09 19:21:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21202 to 15634. [2024-11-09 19:21:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15634 states, 15633 states have (on average 1.7663276402481929) internal successors, (27613), 15633 states have internal predecessors, (27613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15634 states to 15634 states and 27613 transitions. [2024-11-09 19:21:15,331 INFO L78 Accepts]: Start accepts. Automaton has 15634 states and 27613 transitions. Word has length 533 [2024-11-09 19:21:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 15634 states and 27613 transitions. [2024-11-09 19:21:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 15634 states and 27613 transitions. [2024-11-09 19:21:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2024-11-09 19:21:15,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:15,365 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:15,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:21:15,368 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2108494590, now seen corresponding path program 1 times [2024-11-09 19:21:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956383369] [2024-11-09 19:21:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 720 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-09 19:21:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956383369] [2024-11-09 19:21:16,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956383369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:16,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292070280] [2024-11-09 19:21:16,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:16,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:16,275 INFO L87 Difference]: Start difference. First operand 15634 states and 27613 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:17,238 INFO L93 Difference]: Finished difference Result 32377 states and 57160 transitions. [2024-11-09 19:21:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 575 [2024-11-09 19:21:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:17,267 INFO L225 Difference]: With dead ends: 32377 [2024-11-09 19:21:17,268 INFO L226 Difference]: Without dead ends: 17859 [2024-11-09 19:21:17,278 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-11-09 19:21:17,279 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:17,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 84 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17859 states. [2024-11-09 19:21:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17859 to 15053. [2024-11-09 19:21:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 15052 states have (on average 1.7575737443529098) internal successors, (26455), 15052 states have internal predecessors, (26455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 26455 transitions. [2024-11-09 19:21:17,426 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 26455 transitions. Word has length 575 [2024-11-09 19:21:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:17,426 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 26455 transitions. [2024-11-09 19:21:17,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 26455 transitions. [2024-11-09 19:21:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2024-11-09 19:21:17,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:17,439 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-09 19:21:17,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:21:17,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:17,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1096472559, now seen corresponding path program 1 times [2024-11-09 19:21:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:17,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170966262] [2024-11-09 19:21:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 936 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-11-09 19:21:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:17,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170966262] [2024-11-09 19:21:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170966262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:17,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:17,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:17,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442578962] [2024-11-09 19:21:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:17,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:17,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:17,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:17,953 INFO L87 Difference]: Start difference. First operand 15053 states and 26455 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:18,780 INFO L93 Difference]: Finished difference Result 30299 states and 53234 transitions. [2024-11-09 19:21:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:18,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 630 [2024-11-09 19:21:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:18,799 INFO L225 Difference]: With dead ends: 30299 [2024-11-09 19:21:18,799 INFO L226 Difference]: Without dead ends: 16362 [2024-11-09 19:21:18,805 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-11-09 19:21:18,806 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:18,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 125 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16362 states. [2024-11-09 19:21:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16362 to 14683. [2024-11-09 19:21:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14683 states, 14682 states have (on average 1.758002996866912) internal successors, (25811), 14682 states have internal predecessors, (25811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14683 states to 14683 states and 25811 transitions. [2024-11-09 19:21:18,961 INFO L78 Accepts]: Start accepts. Automaton has 14683 states and 25811 transitions. Word has length 630 [2024-11-09 19:21:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 14683 states and 25811 transitions. [2024-11-09 19:21:18,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 14683 states and 25811 transitions. [2024-11-09 19:21:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-11-09 19:21:18,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:18,976 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:18,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:21:18,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:18,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2050649393, now seen corresponding path program 1 times [2024-11-09 19:21:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771832164] [2024-11-09 19:21:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 878 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-09 19:21:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771832164] [2024-11-09 19:21:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771832164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:20,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:20,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:21:20,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11069435] [2024-11-09 19:21:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:20,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:21:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:20,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:21:20,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:21:20,433 INFO L87 Difference]: Start difference. First operand 14683 states and 25811 transitions. Second operand has 7 states, 7 states have (on average 59.57142857142857) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:22,289 INFO L93 Difference]: Finished difference Result 31590 states and 55449 transitions. [2024-11-09 19:21:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 19:21:22,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 59.57142857142857) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 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 685 [2024-11-09 19:21:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:22,311 INFO L225 Difference]: With dead ends: 31590 [2024-11-09 19:21:22,312 INFO L226 Difference]: Without dead ends: 17834 [2024-11-09 19:21:22,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:21:22,323 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 512 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:22,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 235 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:21:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17834 states. [2024-11-09 19:21:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17834 to 15239. [2024-11-09 19:21:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15239 states, 15238 states have (on average 1.7556765979787374) internal successors, (26753), 15238 states have internal predecessors, (26753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15239 states to 15239 states and 26753 transitions. [2024-11-09 19:21:22,553 INFO L78 Accepts]: Start accepts. Automaton has 15239 states and 26753 transitions. Word has length 685 [2024-11-09 19:21:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:22,554 INFO L471 AbstractCegarLoop]: Abstraction has 15239 states and 26753 transitions. [2024-11-09 19:21:22,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.57142857142857) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15239 states and 26753 transitions. [2024-11-09 19:21:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2024-11-09 19:21:22,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:22,576 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:22,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:21:22,576 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:22,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2022927601, now seen corresponding path program 1 times [2024-11-09 19:21:22,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:22,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179044769] [2024-11-09 19:21:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 900 proven. 8 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-09 19:21:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179044769] [2024-11-09 19:21:23,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179044769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806461498] [2024-11-09 19:21:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:23,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:21:23,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:21:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:24,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 19:21:24,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 786 proven. 122 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-09 19:21:25,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:21:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 786 proven. 122 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-09 19:21:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806461498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:21:28,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:21:28,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-11-09 19:21:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844150854] [2024-11-09 19:21:28,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:21:28,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 19:21:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 19:21:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 19:21:28,309 INFO L87 Difference]: Start difference. First operand 15239 states and 26753 transitions. Second operand has 11 states, 11 states have (on average 90.81818181818181) internal successors, (999), 10 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:33,503 INFO L93 Difference]: Finished difference Result 34917 states and 61150 transitions. [2024-11-09 19:21:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 19:21:33,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 90.81818181818181) internal successors, (999), 10 states have internal predecessors, (999), 0 states have call successors, (0), 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 695 [2024-11-09 19:21:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:33,504 INFO L225 Difference]: With dead ends: 34917 [2024-11-09 19:21:33,504 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:21:33,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1412 GetRequests, 1387 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-11-09 19:21:33,517 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 3704 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6618 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3704 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 6618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:33,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3704 Valid, 202 Invalid, 7224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 6618 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 19:21:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:21:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:21:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:21:33,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 695 [2024-11-09 19:21:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:33,518 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:21:33,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.81818181818181) internal successors, (999), 10 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:21:33,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:21:33,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:21:33,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 19:21:33,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 19:21:33,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:33,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:21:36,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:21:36,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:21:36 BoogieIcfgContainer [2024-11-09 19:21:36,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:21:36,983 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:21:36,983 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:21:36,983 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:21:36,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:54" (3/4) ... [2024-11-09 19:21:36,985 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:21:37,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:21:37,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:21:37,012 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:21:37,016 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:21:37,170 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:21:37,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:21:37,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:21:37,172 INFO L158 Benchmark]: Toolchain (without parser) took 45589.82ms. Allocated memory was 209.7MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 137.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-09 19:21:37,172 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:21:37,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.65ms. Allocated memory is still 209.7MB. Free memory was 137.8MB in the beginning and 90.3MB in the end (delta: 47.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-09 19:21:37,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.29ms. Allocated memory is still 209.7MB. Free memory was 90.3MB in the beginning and 72.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 19:21:37,173 INFO L158 Benchmark]: Boogie Preprocessor took 216.21ms. Allocated memory is still 209.7MB. Free memory was 72.8MB in the beginning and 152.2MB in the end (delta: -79.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-09 19:21:37,173 INFO L158 Benchmark]: IcfgBuilder took 1960.82ms. Allocated memory is still 209.7MB. Free memory was 152.2MB in the beginning and 144.8MB in the end (delta: 7.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2024-11-09 19:21:37,175 INFO L158 Benchmark]: TraceAbstraction took 42515.99ms. Allocated memory was 209.7MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 144.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-09 19:21:37,176 INFO L158 Benchmark]: Witness Printer took 188.75ms. Allocated memory is still 3.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 19:21:37,176 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.65ms. Allocated memory is still 209.7MB. Free memory was 137.8MB in the beginning and 90.3MB in the end (delta: 47.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.29ms. Allocated memory is still 209.7MB. Free memory was 90.3MB in the beginning and 72.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 216.21ms. Allocated memory is still 209.7MB. Free memory was 72.8MB in the beginning and 152.2MB in the end (delta: -79.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1960.82ms. Allocated memory is still 209.7MB. Free memory was 152.2MB in the beginning and 144.8MB in the end (delta: 7.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42515.99ms. Allocated memory was 209.7MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 144.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 188.75ms. Allocated memory is still 3.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 187]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.2s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8775 SdHoareTripleChecker+Valid, 19.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8775 mSDsluCounter, 4504 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 661 mSDsCounter, 2500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23545 IncrementalHoareTripleChecker+Invalid, 26045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2500 mSolverCounterUnsat, 3843 mSDtfsCounter, 23545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2239 GetRequests, 2182 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16004occurred in iteration=13, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 16599 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 8526 NumberOfCodeBlocks, 8526 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 9199 ConstructedInterpolants, 0 QuantifiedInterpolants, 38211 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1924 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 13571/13931 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:21:37,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE