./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/Problem15_label21.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 8600e46081012803238847cd2abf778e7d8c7b0d254fcc8508e4407170958048 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:29:29,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:29:29,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:29:29,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:29:29,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:29:29,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:29:29,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:29:29,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:29:29,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:29:29,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:29:29,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:29:29,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:29:29,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:29:29,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:29:29,512 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:29:29,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:29:29,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:29:29,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:29:29,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:29:29,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:29:29,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:29:29,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:29:29,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:29:29,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:29:29,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:29:29,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:29:29,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:29:29,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:29:29,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:29:29,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:29:29,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:29:29,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:29:29,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:29:29,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:29:29,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:29:29,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:29:29,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:29:29,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:29:29,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:29:29,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:29:29,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:29:29,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:29:29,522 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 -> 8600e46081012803238847cd2abf778e7d8c7b0d254fcc8508e4407170958048 [2024-11-08 11:29:29,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:29:29,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:29:29,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:29:29,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:29:29,802 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:29:29,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label21.c [2024-11-08 11:29:31,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:29:31,626 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:29:31,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label21.c [2024-11-08 11:29:31,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e289698/1ce2897c7ce7424c898aa9eda6eea816/FLAGd44f01cb2 [2024-11-08 11:29:31,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e289698/1ce2897c7ce7424c898aa9eda6eea816 [2024-11-08 11:29:31,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:29:31,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:29:31,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:29:31,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:29:31,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:29:31,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:31" (1/1) ... [2024-11-08 11:29:31,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55179da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:31, skipping insertion in model container [2024-11-08 11:29:31,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:31" (1/1) ... [2024-11-08 11:29:31,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:29:32,032 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/Problem15_label21.c[7300,7313] [2024-11-08 11:29:32,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:29:32,415 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:29:32,442 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/Problem15_label21.c[7300,7313] [2024-11-08 11:29:32,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:29:32,690 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:29:32,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32 WrapperNode [2024-11-08 11:29:32,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:29:32,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:29:32,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:29:32,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:29:32,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:32,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:32,915 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-08 11:29:32,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:29:32,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:29:32,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:29:32,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:29:32,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:32,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:32,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,108 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-08 11:29:33,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:29:33,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:29:33,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:29:33,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:29:33,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (1/1) ... [2024-11-08 11:29:33,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:29:33,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:29:33,350 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-08 11:29:33,353 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-08 11:29:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:29:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:29:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:29:33,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:29:33,463 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:29:33,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:29:35,875 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-08 11:29:35,875 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:29:35,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:29:35,909 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:29:35,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:29:35 BoogieIcfgContainer [2024-11-08 11:29:35,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:29:35,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:29:35,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:29:35,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:29:35,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:29:31" (1/3) ... [2024-11-08 11:29:35,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2fd1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:29:35, skipping insertion in model container [2024-11-08 11:29:35,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:32" (2/3) ... [2024-11-08 11:29:35,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2fd1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:29:35, skipping insertion in model container [2024-11-08 11:29:35,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:29:35" (3/3) ... [2024-11-08 11:29:35,918 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label21.c [2024-11-08 11:29:35,935 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:29:35,935 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:29:36,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:29:36,023 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;@5e8f3014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:29:36,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:29:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 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-08 11:29:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 11:29:36,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:36,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:29:36,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:36,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2024-11-08 11:29:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713693864] [2024-11-08 11:29:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:36,499 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-08 11:29:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713693864] [2024-11-08 11:29:36,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713693864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:36,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:36,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:29:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7032658] [2024-11-08 11:29:36,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:36,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:36,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:36,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:36,547 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:29:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:38,861 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-08 11:29:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:29:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-08 11:29:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:38,884 INFO L225 Difference]: With dead ends: 1154 [2024-11-08 11:29:38,885 INFO L226 Difference]: Without dead ends: 665 [2024-11-08 11:29:38,893 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-08 11:29:38,898 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 261 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:38,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 11:29:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-08 11:29:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-08 11:29:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 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-08 11:29:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-08 11:29:38,978 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 60 [2024-11-08 11:29:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-08 11:29:38,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:29:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-08 11:29:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 11:29:38,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:38,983 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:29:38,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:29:38,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:38,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1470560157, now seen corresponding path program 1 times [2024-11-08 11:29:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:38,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339416632] [2024-11-08 11:29:38,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:29:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339416632] [2024-11-08 11:29:39,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339416632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:39,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:39,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:29:39,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438844645] [2024-11-08 11:29:39,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:39,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:39,385 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-08 11:29:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:40,578 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-08 11:29:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:29:40,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-08 11:29:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:40,583 INFO L225 Difference]: With dead ends: 1624 [2024-11-08 11:29:40,583 INFO L226 Difference]: Without dead ends: 963 [2024-11-08 11:29:40,588 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-08 11:29:40,591 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:40,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:29:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-08 11:29:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-08 11:29:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 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-08 11:29:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-08 11:29:40,636 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 125 [2024-11-08 11:29:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:40,638 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-08 11:29:40,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-08 11:29:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-08 11:29:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 11:29:40,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:40,642 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:29:40,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:29:40,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 390257644, now seen corresponding path program 1 times [2024-11-08 11:29:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:40,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989814884] [2024-11-08 11:29:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:29:40,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:40,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989814884] [2024-11-08 11:29:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989814884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:40,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:29:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798570525] [2024-11-08 11:29:40,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:40,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:40,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:40,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:40,882 INFO L87 Difference]: Start difference. First operand 963 states and 1311 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-08 11:29:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:42,349 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-08 11:29:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:29:42,350 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-08 11:29:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:42,356 INFO L225 Difference]: With dead ends: 2229 [2024-11-08 11:29:42,356 INFO L226 Difference]: Without dead ends: 1567 [2024-11-08 11:29:42,358 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-08 11:29:42,359 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:42,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 316 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:29:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-08 11:29:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-08 11:29:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 0 states have call successors, (0), 0 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-08 11:29:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions. [2024-11-08 11:29:42,385 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 130 [2024-11-08 11:29:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions. [2024-11-08 11:29:42,386 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-08 11:29:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions. [2024-11-08 11:29:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 11:29:42,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:42,388 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, 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] [2024-11-08 11:29:42,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:29:42,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:42,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:42,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2079722898, now seen corresponding path program 1 times [2024-11-08 11:29:42,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:42,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159433937] [2024-11-08 11:29:42,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:42,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:29:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:42,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159433937] [2024-11-08 11:29:42,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159433937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:29:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717114062] [2024-11-08 11:29:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:29:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:29:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:29:42,569 INFO L87 Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-08 11:29:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:45,352 INFO L93 Difference]: Finished difference Result 4668 states and 6173 transitions. [2024-11-08 11:29:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:29:45,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2024-11-08 11:29:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:45,365 INFO L225 Difference]: With dead ends: 4668 [2024-11-08 11:29:45,365 INFO L226 Difference]: Without dead ends: 3404 [2024-11-08 11:29:45,399 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-08 11:29:45,400 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 501 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:45,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 377 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 11:29:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2024-11-08 11:29:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2024-11-08 11:29:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 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-08 11:29:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2024-11-08 11:29:45,459 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 151 [2024-11-08 11:29:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:45,460 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2024-11-08 11:29:45,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-08 11:29:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2024-11-08 11:29:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 11:29:45,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:45,465 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, 3, 3, 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] [2024-11-08 11:29:45,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:29:45,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:45,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1147155747, now seen corresponding path program 1 times [2024-11-08 11:29:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:45,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491391395] [2024-11-08 11:29:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:45,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-08 11:29:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491391395] [2024-11-08 11:29:45,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491391395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:45,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:45,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:29:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071941825] [2024-11-08 11:29:45,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:45,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:45,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:45,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:45,688 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-08 11:29:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:46,986 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2024-11-08 11:29:46,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:29:46,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 219 [2024-11-08 11:29:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:47,008 INFO L225 Difference]: With dead ends: 8563 [2024-11-08 11:29:47,009 INFO L226 Difference]: Without dead ends: 5483 [2024-11-08 11:29:47,014 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-08 11:29:47,017 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:47,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:29:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-08 11:29:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-08 11:29:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 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-08 11:29:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2024-11-08 11:29:47,150 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 219 [2024-11-08 11:29:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:47,151 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2024-11-08 11:29:47,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-08 11:29:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2024-11-08 11:29:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-08 11:29:47,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:47,158 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:29:47,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:29:47,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:47,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash 563393677, now seen corresponding path program 1 times [2024-11-08 11:29:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:47,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420291363] [2024-11-08 11:29:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-08 11:29:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420291363] [2024-11-08 11:29:47,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420291363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:47,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:29:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740288650] [2024-11-08 11:29:47,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:47,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:47,898 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:29:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:49,069 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2024-11-08 11:29:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:29:49,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2024-11-08 11:29:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:49,086 INFO L225 Difference]: With dead ends: 10655 [2024-11-08 11:29:49,086 INFO L226 Difference]: Without dead ends: 5478 [2024-11-08 11:29:49,092 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-08 11:29:49,093 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:49,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:29:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-08 11:29:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-08 11:29:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 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-08 11:29:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2024-11-08 11:29:49,184 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 321 [2024-11-08 11:29:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:49,188 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2024-11-08 11:29:49,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:29:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2024-11-08 11:29:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-08 11:29:49,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:49,194 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:29:49,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:29:49,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:49,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2051358338, now seen corresponding path program 1 times [2024-11-08 11:29:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:49,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117813272] [2024-11-08 11:29:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 11:29:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117813272] [2024-11-08 11:29:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117813272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:49,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:49,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:29:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382094265] [2024-11-08 11:29:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:49,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:49,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:49,497 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-08 11:29:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:51,137 INFO L93 Difference]: Finished difference Result 11851 states and 14149 transitions. [2024-11-08 11:29:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:29:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 347 [2024-11-08 11:29:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:51,161 INFO L225 Difference]: With dead ends: 11851 [2024-11-08 11:29:51,161 INFO L226 Difference]: Without dead ends: 6674 [2024-11-08 11:29:51,168 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-08 11:29:51,169 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 255 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:51,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:29:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2024-11-08 11:29:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2024-11-08 11:29:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1755897435897436) internal successors, (5731), 4875 states have internal predecessors, (5731), 0 states have call successors, (0), 0 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-08 11:29:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5731 transitions. [2024-11-08 11:29:51,257 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5731 transitions. Word has length 347 [2024-11-08 11:29:51,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:51,258 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5731 transitions. [2024-11-08 11:29:51,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-08 11:29:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5731 transitions. [2024-11-08 11:29:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-08 11:29:51,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:51,268 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:29:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:29:51,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 929697791, now seen corresponding path program 1 times [2024-11-08 11:29:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292747897] [2024-11-08 11:29:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:29:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:51,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292747897] [2024-11-08 11:29:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292747897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:51,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:51,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:29:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570196008] [2024-11-08 11:29:51,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:51,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:51,701 INFO L87 Difference]: Start difference. First operand 4876 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-08 11:29:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:53,073 INFO L93 Difference]: Finished difference Result 11553 states and 13859 transitions. [2024-11-08 11:29:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:29:53,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 406 [2024-11-08 11:29:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:53,100 INFO L225 Difference]: With dead ends: 11553 [2024-11-08 11:29:53,100 INFO L226 Difference]: Without dead ends: 6978 [2024-11-08 11:29:53,106 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-08 11:29:53,108 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 268 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:53,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:29:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6978 states. [2024-11-08 11:29:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6978 to 6380. [2024-11-08 11:29:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1520614516381877) internal successors, (7349), 6379 states have internal predecessors, (7349), 0 states have call successors, (0), 0 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-08 11:29:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7349 transitions. [2024-11-08 11:29:53,216 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7349 transitions. Word has length 406 [2024-11-08 11:29:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:53,217 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7349 transitions. [2024-11-08 11:29:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-08 11:29:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7349 transitions. [2024-11-08 11:29:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-08 11:29:53,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:53,225 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:29:53,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:29:53,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1611989383, now seen corresponding path program 1 times [2024-11-08 11:29:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892887509] [2024-11-08 11:29:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 115 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:29:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892887509] [2024-11-08 11:29:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892887509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:29:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381040153] [2024-11-08 11:29:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:54,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:29:54,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:29:54,221 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-08 11:29:54,222 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-08 11:29:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:54,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:29:54,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:29:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 11:29:55,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:29:55,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381040153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:55,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:29:55,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:29:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704548224] [2024-11-08 11:29:55,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:55,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:29:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:29:55,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:29:55,125 INFO L87 Difference]: Start difference. First operand 6380 states and 7349 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-08 11:29:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:29:57,804 INFO L93 Difference]: Finished difference Result 21156 states and 24653 transitions. [2024-11-08 11:29:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:29:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 407 [2024-11-08 11:29:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:29:57,830 INFO L225 Difference]: With dead ends: 21156 [2024-11-08 11:29:57,830 INFO L226 Difference]: Without dead ends: 12984 [2024-11-08 11:29:57,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:29:57,841 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 480 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:29:57,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 123 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:29:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12984 states. [2024-11-08 11:29:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12984 to 12982. [2024-11-08 11:29:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12982 states, 12981 states have (on average 1.1269547800631692) internal successors, (14629), 12981 states have internal predecessors, (14629), 0 states have call successors, (0), 0 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-08 11:29:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12982 states to 12982 states and 14629 transitions. [2024-11-08 11:29:58,019 INFO L78 Accepts]: Start accepts. Automaton has 12982 states and 14629 transitions. Word has length 407 [2024-11-08 11:29:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:29:58,019 INFO L471 AbstractCegarLoop]: Abstraction has 12982 states and 14629 transitions. [2024-11-08 11:29:58,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-08 11:29:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 12982 states and 14629 transitions. [2024-11-08 11:29:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-11-08 11:29:58,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:29:58,027 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:29:58,046 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-08 11:29:58,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:29:58,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:29:58,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:29:58,229 INFO L85 PathProgramCache]: Analyzing trace with hash -196094166, now seen corresponding path program 1 times [2024-11-08 11:29:58,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:29:58,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788381134] [2024-11-08 11:29:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:29:58,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:29:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:29:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:29:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:29:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788381134] [2024-11-08 11:29:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788381134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:29:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:29:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:29:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726648481] [2024-11-08 11:29:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:29:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:29:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:29:58,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:29:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:29:58,607 INFO L87 Difference]: Start difference. First operand 12982 states and 14629 transitions. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-08 11:30:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:00,417 INFO L93 Difference]: Finished difference Result 29261 states and 33262 transitions. [2024-11-08 11:30:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:00,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 423 [2024-11-08 11:30:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:00,445 INFO L225 Difference]: With dead ends: 29261 [2024-11-08 11:30:00,445 INFO L226 Difference]: Without dead ends: 16580 [2024-11-08 11:30:00,459 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-08 11:30:00,460 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 237 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:00,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 638 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 11:30:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16580 states. [2024-11-08 11:30:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16580 to 15380. [2024-11-08 11:30:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15380 states, 15379 states have (on average 1.1081994928148775) internal successors, (17043), 15379 states have internal predecessors, (17043), 0 states have call successors, (0), 0 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-08 11:30:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15380 states to 15380 states and 17043 transitions. [2024-11-08 11:30:00,654 INFO L78 Accepts]: Start accepts. Automaton has 15380 states and 17043 transitions. Word has length 423 [2024-11-08 11:30:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:00,655 INFO L471 AbstractCegarLoop]: Abstraction has 15380 states and 17043 transitions. [2024-11-08 11:30:00,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-08 11:30:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15380 states and 17043 transitions. [2024-11-08 11:30:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-08 11:30:00,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:00,658 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:00,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:30:00,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:00,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1057545053, now seen corresponding path program 1 times [2024-11-08 11:30:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745413882] [2024-11-08 11:30:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 11:30:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745413882] [2024-11-08 11:30:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745413882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:01,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:01,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086806500] [2024-11-08 11:30:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:01,024 INFO L87 Difference]: Start difference. First operand 15380 states and 17043 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-08 11:30:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:02,183 INFO L93 Difference]: Finished difference Result 33451 states and 37437 transitions. [2024-11-08 11:30:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 437 [2024-11-08 11:30:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:02,216 INFO L225 Difference]: With dead ends: 33451 [2024-11-08 11:30:02,216 INFO L226 Difference]: Without dead ends: 18372 [2024-11-08 11:30:02,233 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-08 11:30:02,234 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 267 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:02,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 600 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:30:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18372 states. [2024-11-08 11:30:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18372 to 17768. [2024-11-08 11:30:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17768 states, 17767 states have (on average 1.1002983058479203) internal successors, (19549), 17767 states have internal predecessors, (19549), 0 states have call successors, (0), 0 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-08 11:30:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17768 states to 17768 states and 19549 transitions. [2024-11-08 11:30:02,631 INFO L78 Accepts]: Start accepts. Automaton has 17768 states and 19549 transitions. Word has length 437 [2024-11-08 11:30:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:02,632 INFO L471 AbstractCegarLoop]: Abstraction has 17768 states and 19549 transitions. [2024-11-08 11:30:02,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-08 11:30:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 17768 states and 19549 transitions. [2024-11-08 11:30:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2024-11-08 11:30:02,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:02,642 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:02,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:30:02,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:02,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 356817365, now seen corresponding path program 1 times [2024-11-08 11:30:02,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:02,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404238522] [2024-11-08 11:30:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-11-08 11:30:02,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:02,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404238522] [2024-11-08 11:30:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404238522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:02,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:02,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550217092] [2024-11-08 11:30:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:02,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:02,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:02,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:02,983 INFO L87 Difference]: Start difference. First operand 17768 states and 19549 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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-08 11:30:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:04,343 INFO L93 Difference]: Finished difference Result 42110 states and 46331 transitions. [2024-11-08 11:30:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:04,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 537 [2024-11-08 11:30:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:04,368 INFO L225 Difference]: With dead ends: 42110 [2024-11-08 11:30:04,368 INFO L226 Difference]: Without dead ends: 21653 [2024-11-08 11:30:04,381 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-08 11:30:04,382 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 263 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:04,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 621 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:30:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21653 states. [2024-11-08 11:30:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21653 to 16554. [2024-11-08 11:30:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16554 states, 16553 states have (on average 1.087597414365976) internal successors, (18003), 16553 states have internal predecessors, (18003), 0 states have call successors, (0), 0 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-08 11:30:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16554 states to 16554 states and 18003 transitions. [2024-11-08 11:30:04,598 INFO L78 Accepts]: Start accepts. Automaton has 16554 states and 18003 transitions. Word has length 537 [2024-11-08 11:30:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:04,599 INFO L471 AbstractCegarLoop]: Abstraction has 16554 states and 18003 transitions. [2024-11-08 11:30:04,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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-08 11:30:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16554 states and 18003 transitions. [2024-11-08 11:30:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-11-08 11:30:04,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:04,605 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:04,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:30:04,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:04,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1649715557, now seen corresponding path program 1 times [2024-11-08 11:30:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:04,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403219352] [2024-11-08 11:30:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-08 11:30:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:04,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403219352] [2024-11-08 11:30:04,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403219352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:04,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:04,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356476615] [2024-11-08 11:30:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:04,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:04,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:04,964 INFO L87 Difference]: Start difference. First operand 16554 states and 18003 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-08 11:30:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:06,027 INFO L93 Difference]: Finished difference Result 33104 states and 36006 transitions. [2024-11-08 11:30:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 561 [2024-11-08 11:30:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:06,041 INFO L225 Difference]: With dead ends: 33104 [2024-11-08 11:30:06,041 INFO L226 Difference]: Without dead ends: 16851 [2024-11-08 11:30:06,050 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-08 11:30:06,050 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 463 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:06,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 69 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16851 states. [2024-11-08 11:30:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16851 to 16552. [2024-11-08 11:30:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16552 states, 16551 states have (on average 1.0874871608966226) internal successors, (17999), 16551 states have internal predecessors, (17999), 0 states have call successors, (0), 0 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-08 11:30:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16552 states to 16552 states and 17999 transitions. [2024-11-08 11:30:06,225 INFO L78 Accepts]: Start accepts. Automaton has 16552 states and 17999 transitions. Word has length 561 [2024-11-08 11:30:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 16552 states and 17999 transitions. [2024-11-08 11:30:06,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-08 11:30:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 16552 states and 17999 transitions. [2024-11-08 11:30:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2024-11-08 11:30:06,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:06,237 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:30:06,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:30:06,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:06,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash -199213231, now seen corresponding path program 1 times [2024-11-08 11:30:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:06,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638974521] [2024-11-08 11:30:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-08 11:30:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638974521] [2024-11-08 11:30:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638974521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:06,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:06,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716345478] [2024-11-08 11:30:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:06,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:06,522 INFO L87 Difference]: Start difference. First operand 16552 states and 17999 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-08 11:30:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:07,442 INFO L93 Difference]: Finished difference Result 34595 states and 37634 transitions. [2024-11-08 11:30:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 570 [2024-11-08 11:30:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:07,457 INFO L225 Difference]: With dead ends: 34595 [2024-11-08 11:30:07,458 INFO L226 Difference]: Without dead ends: 17148 [2024-11-08 11:30:07,468 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-08 11:30:07,469 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 270 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:07,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 280 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:30:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17148 states. [2024-11-08 11:30:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17148 to 12358. [2024-11-08 11:30:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12358 states, 12357 states have (on average 1.0807639394675084) internal successors, (13355), 12357 states have internal predecessors, (13355), 0 states have call successors, (0), 0 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-08 11:30:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12358 states to 12358 states and 13355 transitions. [2024-11-08 11:30:07,621 INFO L78 Accepts]: Start accepts. Automaton has 12358 states and 13355 transitions. Word has length 570 [2024-11-08 11:30:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 12358 states and 13355 transitions. [2024-11-08 11:30:07,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-08 11:30:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 12358 states and 13355 transitions. [2024-11-08 11:30:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-11-08 11:30:07,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:07,627 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, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:30:07,628 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 763441762, now seen corresponding path program 1 times [2024-11-08 11:30:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:07,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271718623] [2024-11-08 11:30:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-08 11:30:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271718623] [2024-11-08 11:30:08,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271718623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:08,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:08,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070632366] [2024-11-08 11:30:08,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:08,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:08,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:08,189 INFO L87 Difference]: Start difference. First operand 12358 states and 13355 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-08 11:30:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:09,298 INFO L93 Difference]: Finished difference Result 29811 states and 32253 transitions. [2024-11-08 11:30:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:09,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 627 [2024-11-08 11:30:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:09,316 INFO L225 Difference]: With dead ends: 29811 [2024-11-08 11:30:09,316 INFO L226 Difference]: Without dead ends: 17754 [2024-11-08 11:30:09,329 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-08 11:30:09,329 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 254 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:09,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 557 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17754 states. [2024-11-08 11:30:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17754 to 16846. [2024-11-08 11:30:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16846 states, 16845 states have (on average 1.0694568121104184) internal successors, (18015), 16845 states have internal predecessors, (18015), 0 states have call successors, (0), 0 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-08 11:30:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16846 states to 16846 states and 18015 transitions. [2024-11-08 11:30:09,568 INFO L78 Accepts]: Start accepts. Automaton has 16846 states and 18015 transitions. Word has length 627 [2024-11-08 11:30:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:09,568 INFO L471 AbstractCegarLoop]: Abstraction has 16846 states and 18015 transitions. [2024-11-08 11:30:09,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-08 11:30:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 16846 states and 18015 transitions. [2024-11-08 11:30:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2024-11-08 11:30:09,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:09,581 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:09,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:30:09,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1417126583, now seen corresponding path program 1 times [2024-11-08 11:30:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445651268] [2024-11-08 11:30:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-11-08 11:30:09,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:09,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445651268] [2024-11-08 11:30:09,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445651268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:09,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:09,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:09,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016938644] [2024-11-08 11:30:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:09,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:09,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:09,892 INFO L87 Difference]: Start difference. First operand 16846 states and 18015 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-08 11:30:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:10,898 INFO L93 Difference]: Finished difference Result 39069 states and 41837 transitions. [2024-11-08 11:30:10,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:10,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 632 [2024-11-08 11:30:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:10,917 INFO L225 Difference]: With dead ends: 39069 [2024-11-08 11:30:10,917 INFO L226 Difference]: Without dead ends: 22524 [2024-11-08 11:30:10,926 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-08 11:30:10,927 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 283 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:10,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 197 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:30:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22524 states. [2024-11-08 11:30:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22524 to 18636. [2024-11-08 11:30:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18636 states, 18635 states have (on average 1.069170914944996) internal successors, (19924), 18635 states have internal predecessors, (19924), 0 states have call successors, (0), 0 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-08 11:30:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18636 states to 18636 states and 19924 transitions. [2024-11-08 11:30:11,088 INFO L78 Accepts]: Start accepts. Automaton has 18636 states and 19924 transitions. Word has length 632 [2024-11-08 11:30:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:11,089 INFO L471 AbstractCegarLoop]: Abstraction has 18636 states and 19924 transitions. [2024-11-08 11:30:11,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-08 11:30:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18636 states and 19924 transitions. [2024-11-08 11:30:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2024-11-08 11:30:11,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:11,099 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:11,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:30:11,099 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:11,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1742207972, now seen corresponding path program 1 times [2024-11-08 11:30:11,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:11,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208576908] [2024-11-08 11:30:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:11,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-08 11:30:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208576908] [2024-11-08 11:30:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208576908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:11,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891349199] [2024-11-08 11:30:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:11,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:11,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:11,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:11,406 INFO L87 Difference]: Start difference. First operand 18636 states and 19924 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-08 11:30:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:12,501 INFO L93 Difference]: Finished difference Result 39362 states and 42207 transitions. [2024-11-08 11:30:12,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:12,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 634 [2024-11-08 11:30:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:12,521 INFO L225 Difference]: With dead ends: 39362 [2024-11-08 11:30:12,521 INFO L226 Difference]: Without dead ends: 21027 [2024-11-08 11:30:12,531 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-08 11:30:12,532 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 289 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:12,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 441 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21027 states. [2024-11-08 11:30:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21027 to 19831. [2024-11-08 11:30:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19831 states, 19830 states have (on average 1.0671709531013616) internal successors, (21162), 19830 states have internal predecessors, (21162), 0 states have call successors, (0), 0 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-08 11:30:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19831 states to 19831 states and 21162 transitions. [2024-11-08 11:30:12,775 INFO L78 Accepts]: Start accepts. Automaton has 19831 states and 21162 transitions. Word has length 634 [2024-11-08 11:30:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:12,776 INFO L471 AbstractCegarLoop]: Abstraction has 19831 states and 21162 transitions. [2024-11-08 11:30:12,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-08 11:30:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 19831 states and 21162 transitions. [2024-11-08 11:30:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-11-08 11:30:12,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:12,788 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:12,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:30:12,788 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:12,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -693600640, now seen corresponding path program 1 times [2024-11-08 11:30:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124531623] [2024-11-08 11:30:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:12,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 116 proven. 261 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-08 11:30:13,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124531623] [2024-11-08 11:30:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124531623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:30:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557475433] [2024-11-08 11:30:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:30:13,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:30:13,935 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-08 11:30:13,935 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-08 11:30:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:14,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:30:14,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:30:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-08 11:30:14,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:30:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557475433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:30:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 11:30:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471639993] [2024-11-08 11:30:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:14,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:14,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:30:14,256 INFO L87 Difference]: Start difference. First operand 19831 states and 21162 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-08 11:30:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:15,164 INFO L93 Difference]: Finished difference Result 38755 states and 41389 transitions. [2024-11-08 11:30:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:15,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-08 11:30:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:15,181 INFO L225 Difference]: With dead ends: 38755 [2024-11-08 11:30:15,181 INFO L226 Difference]: Without dead ends: 19225 [2024-11-08 11:30:15,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:30:15,193 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 269 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:15,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 523 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:30:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19225 states. [2024-11-08 11:30:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19225 to 18626. [2024-11-08 11:30:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18626 states, 18625 states have (on average 1.0408590604026846) internal successors, (19386), 18625 states have internal predecessors, (19386), 0 states have call successors, (0), 0 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-08 11:30:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18626 states to 18626 states and 19386 transitions. [2024-11-08 11:30:15,434 INFO L78 Accepts]: Start accepts. Automaton has 18626 states and 19386 transitions. Word has length 685 [2024-11-08 11:30:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:15,435 INFO L471 AbstractCegarLoop]: Abstraction has 18626 states and 19386 transitions. [2024-11-08 11:30:15,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-08 11:30:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 18626 states and 19386 transitions. [2024-11-08 11:30:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2024-11-08 11:30:15,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:15,458 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:30:15,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 11:30:15,658 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,SelfDestructingSolverStorable17 [2024-11-08 11:30:15,659 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:15,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1525669341, now seen corresponding path program 1 times [2024-11-08 11:30:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638582878] [2024-11-08 11:30:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 781 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-11-08 11:30:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638582878] [2024-11-08 11:30:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638582878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:16,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:16,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:30:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740822808] [2024-11-08 11:30:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:16,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:30:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:16,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:30:16,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:30:16,466 INFO L87 Difference]: Start difference. First operand 18626 states and 19386 transitions. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 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-08 11:30:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:18,462 INFO L93 Difference]: Finished difference Result 42341 states and 44010 transitions. [2024-11-08 11:30:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:30:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 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 827 [2024-11-08 11:30:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:18,464 INFO L225 Difference]: With dead ends: 42341 [2024-11-08 11:30:18,464 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:30:18,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 11:30:18,474 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 467 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:18,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 450 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 11:30:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:30:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:30:18,475 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-08 11:30:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:30:18,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 827 [2024-11-08 11:30:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:18,475 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:30:18,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 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-08 11:30:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:30:18,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:30:18,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:30:18,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:30:18,484 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:18,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:30:22,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:30:22,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:30:22 BoogieIcfgContainer [2024-11-08 11:30:22,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:30:22,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:30:22,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:30:22,111 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:30:22,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:29:35" (3/4) ... [2024-11-08 11:30:22,114 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:30:22,146 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 11:30:22,148 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:30:22,150 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:30:22,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:30:22,396 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:30:22,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:30:22,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:30:22,398 INFO L158 Benchmark]: Toolchain (without parser) took 50722.13ms. Allocated memory was 157.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 98.6MB in the beginning and 1.0GB in the end (delta: -933.2MB). Peak memory consumption was 267.0MB. Max. memory is 16.1GB. [2024-11-08 11:30:22,399 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 157.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:30:22,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1013.10ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 98.6MB in the beginning and 154.5MB in the end (delta: -55.9MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-11-08 11:30:22,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 224.09ms. Allocated memory is still 216.0MB. Free memory was 154.5MB in the beginning and 115.7MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 11:30:22,399 INFO L158 Benchmark]: Boogie Preprocessor took 393.80ms. Allocated memory is still 216.0MB. Free memory was 115.7MB in the beginning and 131.8MB in the end (delta: -16.1MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-11-08 11:30:22,400 INFO L158 Benchmark]: RCFGBuilder took 2597.66ms. Allocated memory was 216.0MB in the beginning and 373.3MB in the end (delta: 157.3MB). Free memory was 131.8MB in the beginning and 186.7MB in the end (delta: -54.9MB). Peak memory consumption was 139.6MB. Max. memory is 16.1GB. [2024-11-08 11:30:22,400 INFO L158 Benchmark]: TraceAbstraction took 46198.94ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 983.6MB). Free memory was 186.7MB in the beginning and 1.1GB in the end (delta: -872.4MB). Peak memory consumption was 765.5MB. Max. memory is 16.1GB. [2024-11-08 11:30:22,403 INFO L158 Benchmark]: Witness Printer took 286.73ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 11:30:22,405 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.22ms. Allocated memory is still 157.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1013.10ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 98.6MB in the beginning and 154.5MB in the end (delta: -55.9MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 224.09ms. Allocated memory is still 216.0MB. Free memory was 154.5MB in the beginning and 115.7MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 393.80ms. Allocated memory is still 216.0MB. Free memory was 115.7MB in the beginning and 131.8MB in the end (delta: -16.1MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2597.66ms. Allocated memory was 216.0MB in the beginning and 373.3MB in the end (delta: 157.3MB). Free memory was 131.8MB in the beginning and 186.7MB in the end (delta: -54.9MB). Peak memory consumption was 139.6MB. Max. memory is 16.1GB. * TraceAbstraction took 46198.94ms. Allocated memory was 373.3MB in the beginning and 1.4GB in the end (delta: 983.6MB). Free memory was 186.7MB in the beginning and 1.1GB in the end (delta: -872.4MB). Peak memory consumption was 765.5MB. Max. memory is 16.1GB. * Witness Printer took 286.73ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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: 197]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.5s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5684 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5684 mSDsluCounter, 7567 SdHoareTripleChecker+Invalid, 22.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 812 mSDsCounter, 3849 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19584 IncrementalHoareTripleChecker+Invalid, 23433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3849 mSolverCounterUnsat, 6755 mSDtfsCounter, 19584 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1146 GetRequests, 1119 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19831occurred in iteration=17, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 21312 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 9191 NumberOfCodeBlocks, 9191 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 9170 ConstructedInterpolants, 0 QuantifiedInterpolants, 21059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1303 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 8022/8347 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) || ((((long long) 42 + a4) <= 0) && (3 == a2))) || ((((long long) 42 + a4) <= 0) && (a2 == 4))) || ((5 <= a2) && (((long long) a4 + 86) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 147) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 61) <= 0))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a29 + 127) <= 0))) || (((((long long) 42 + a4) <= 0) && (44 <= a29)) && (5 <= a2))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || (((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || (((44 <= a29) && (a2 == 1)) && (((long long) a4 + 86) <= 0))) || (((((long long) a0 + 147) <= 0) && (a2 == 1)) && (((long long) a4 + 86) <= 0))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1))) || (((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 127) <= 0))) || (((((long long) 42 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:30:22,434 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