./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label47.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 d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:23:33,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:23:33,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:23:33,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:23:33,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:23:33,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:23:33,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:23:33,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:23:33,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:23:33,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:23:33,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:23:33,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:23:33,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:23:33,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:23:33,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:23:33,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:23:33,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:23:33,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:23:33,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:23:33,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:23:33,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:23:33,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:23:33,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:23:33,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:23:33,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:23:33,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:23:33,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:23:33,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:23:33,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:23:33,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:23:33,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:23:33,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:23:33,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:23:33,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:23:33,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:23:33,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:23:33,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:23:33,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:23:33,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:23:33,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:23:33,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:23:33,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:23:33,354 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 -> d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea [2024-11-09 19:23:33,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:23:33,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:23:33,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:23:33,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:23:33,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:23:33,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-11-09 19:23:34,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:23:34,938 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:23:34,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-11-09 19:23:34,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b62a72b/4f95498aa3894232b5b35147327713f7/FLAG107095804 [2024-11-09 19:23:34,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b62a72b/4f95498aa3894232b5b35147327713f7 [2024-11-09 19:23:34,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:23:34,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:23:34,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:23:34,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:23:34,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:23:34,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:23:34" (1/1) ... [2024-11-09 19:23:34,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61132ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:34, skipping insertion in model container [2024-11-09 19:23:34,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:23:34" (1/1) ... [2024-11-09 19:23:35,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:23:35,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c[5129,5142] [2024-11-09 19:23:35,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:23:35,356 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:23:35,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c[5129,5142] [2024-11-09 19:23:35,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:23:35,531 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:23:35,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35 WrapperNode [2024-11-09 19:23:35,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:23:35,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:23:35,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:23:35,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:23:35,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,614 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:23:35,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:23:35,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:23:35,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:23:35,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:23:35,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,668 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:23:35,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:23:35,723 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:23:35,723 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:23:35,723 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:23:35,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (1/1) ... [2024-11-09 19:23:35,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:23:35,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:23:35,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:23:35,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:23:35,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:23:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:23:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:23:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:23:35,844 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:23:35,846 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:23:37,211 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:23:37,211 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:23:37,230 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:23:37,231 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:23:37,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:23:37 BoogieIcfgContainer [2024-11-09 19:23:37,231 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:23:37,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:23:37,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:23:37,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:23:37,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:23:34" (1/3) ... [2024-11-09 19:23:37,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d797b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:23:37, skipping insertion in model container [2024-11-09 19:23:37,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:23:35" (2/3) ... [2024-11-09 19:23:37,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d797b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:23:37, skipping insertion in model container [2024-11-09 19:23:37,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:23:37" (3/3) ... [2024-11-09 19:23:37,239 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2024-11-09 19:23:37,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:23:37,251 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:23:37,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:23:37,315 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;@3ea3e572, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:23:37,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:23:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 19:23:37,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:37,327 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] [2024-11-09 19:23:37,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:37,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1091211516, now seen corresponding path program 1 times [2024-11-09 19:23:37,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:37,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034666487] [2024-11-09 19:23:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:37,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:37,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034666487] [2024-11-09 19:23:37,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034666487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:37,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:23:37,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023546234] [2024-11-09 19:23:37,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:37,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:37,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:37,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:37,623 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:38,703 INFO L93 Difference]: Finished difference Result 782 states and 1726 transitions. [2024-11-09 19:23:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:38,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-09 19:23:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:38,719 INFO L225 Difference]: With dead ends: 782 [2024-11-09 19:23:38,719 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:23:38,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:38,724 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 311 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:38,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 200 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:23:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:23:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2024-11-09 19:23:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 2.0314769975786926) internal successors, (839), 413 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 839 transitions. [2024-11-09 19:23:38,775 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 839 transitions. Word has length 37 [2024-11-09 19:23:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:38,776 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 839 transitions. [2024-11-09 19:23:38,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 839 transitions. [2024-11-09 19:23:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 19:23:38,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:38,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:23:38,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:38,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1304997499, now seen corresponding path program 1 times [2024-11-09 19:23:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181354243] [2024-11-09 19:23:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:38,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181354243] [2024-11-09 19:23:38,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181354243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:38,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:38,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:23:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962322081] [2024-11-09 19:23:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:38,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:38,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:38,949 INFO L87 Difference]: Start difference. First operand 414 states and 839 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:39,700 INFO L93 Difference]: Finished difference Result 1217 states and 2487 transitions. [2024-11-09 19:23:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-11-09 19:23:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:39,704 INFO L225 Difference]: With dead ends: 1217 [2024-11-09 19:23:39,704 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:23:39,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:39,706 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:39,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 127 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:23:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:23:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 792. [2024-11-09 19:23:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.9835651074589127) internal successors, (1569), 791 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1569 transitions. [2024-11-09 19:23:39,733 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1569 transitions. Word has length 106 [2024-11-09 19:23:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:39,734 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1569 transitions. [2024-11-09 19:23:39,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1569 transitions. [2024-11-09 19:23:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 19:23:39,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:39,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:39,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:23:39,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:39,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:39,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1890631039, now seen corresponding path program 1 times [2024-11-09 19:23:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:39,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915838814] [2024-11-09 19:23:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:39,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915838814] [2024-11-09 19:23:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915838814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:23:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267136224] [2024-11-09 19:23:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:39,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:39,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:39,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:39,955 INFO L87 Difference]: Start difference. First operand 792 states and 1569 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:40,731 INFO L93 Difference]: Finished difference Result 1953 states and 3830 transitions. [2024-11-09 19:23:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-09 19:23:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:40,739 INFO L225 Difference]: With dead ends: 1953 [2024-11-09 19:23:40,739 INFO L226 Difference]: Without dead ends: 1163 [2024-11-09 19:23:40,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:40,741 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 238 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:40,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 197 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:23:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-09 19:23:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2024-11-09 19:23:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 1.8898450946643717) internal successors, (2196), 1162 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2196 transitions. [2024-11-09 19:23:40,759 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2196 transitions. Word has length 108 [2024-11-09 19:23:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:40,760 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 2196 transitions. [2024-11-09 19:23:40,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2196 transitions. [2024-11-09 19:23:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 19:23:40,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:40,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:40,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:23:40,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:40,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash 306088201, now seen corresponding path program 1 times [2024-11-09 19:23:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622313322] [2024-11-09 19:23:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 19:23:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:40,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622313322] [2024-11-09 19:23:40,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622313322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:40,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:40,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:23:40,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953481519] [2024-11-09 19:23:40,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:40,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:40,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:40,943 INFO L87 Difference]: Start difference. First operand 1163 states and 2196 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:41,759 INFO L93 Difference]: Finished difference Result 3074 states and 5836 transitions. [2024-11-09 19:23:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 150 [2024-11-09 19:23:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:41,765 INFO L225 Difference]: With dead ends: 3074 [2024-11-09 19:23:41,765 INFO L226 Difference]: Without dead ends: 1913 [2024-11-09 19:23:41,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:41,767 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 227 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:41,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 161 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:23:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2024-11-09 19:23:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2024-11-09 19:23:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1911 states have (on average 1.8414442700156985) internal successors, (3519), 1911 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3519 transitions. [2024-11-09 19:23:41,792 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3519 transitions. Word has length 150 [2024-11-09 19:23:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:41,793 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 3519 transitions. [2024-11-09 19:23:41,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3519 transitions. [2024-11-09 19:23:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 19:23:41,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:41,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:41,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:23:41,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:41,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1451591640, now seen corresponding path program 1 times [2024-11-09 19:23:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:41,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306741535] [2024-11-09 19:23:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306741535] [2024-11-09 19:23:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306741535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133845577] [2024-11-09 19:23:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:41,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:23:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:41,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:23:41,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:41,997 INFO L87 Difference]: Start difference. First operand 1912 states and 3519 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:43,226 INFO L93 Difference]: Finished difference Result 5702 states and 10769 transitions. [2024-11-09 19:23:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:23:43,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-09 19:23:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:43,238 INFO L225 Difference]: With dead ends: 5702 [2024-11-09 19:23:43,238 INFO L226 Difference]: Without dead ends: 3977 [2024-11-09 19:23:43,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:43,241 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 598 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:43,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 93 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:23:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2024-11-09 19:23:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3976. [2024-11-09 19:23:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3976 states, 3975 states have (on average 1.8621383647798742) internal successors, (7402), 3975 states have internal predecessors, (7402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 7402 transitions. [2024-11-09 19:23:43,316 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 7402 transitions. Word has length 165 [2024-11-09 19:23:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:43,316 INFO L471 AbstractCegarLoop]: Abstraction has 3976 states and 7402 transitions. [2024-11-09 19:23:43,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 7402 transitions. [2024-11-09 19:23:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 19:23:43,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:43,319 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:23:43,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:23:43,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:43,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1850052388, now seen corresponding path program 1 times [2024-11-09 19:23:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:43,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528041843] [2024-11-09 19:23:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:23:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528041843] [2024-11-09 19:23:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528041843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:43,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:43,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072057487] [2024-11-09 19:23:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:43,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:43,480 INFO L87 Difference]: Start difference. First operand 3976 states and 7402 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:44,305 INFO L93 Difference]: Finished difference Result 8888 states and 16785 transitions. [2024-11-09 19:23:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 221 [2024-11-09 19:23:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:44,320 INFO L225 Difference]: With dead ends: 8888 [2024-11-09 19:23:44,320 INFO L226 Difference]: Without dead ends: 5284 [2024-11-09 19:23:44,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:44,324 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 281 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:44,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 517 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:23:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5284 states. [2024-11-09 19:23:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5284 to 5272. [2024-11-09 19:23:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5272 states, 5271 states have (on average 1.844621513944223) internal successors, (9723), 5271 states have internal predecessors, (9723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5272 states to 5272 states and 9723 transitions. [2024-11-09 19:23:44,391 INFO L78 Accepts]: Start accepts. Automaton has 5272 states and 9723 transitions. Word has length 221 [2024-11-09 19:23:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:44,391 INFO L471 AbstractCegarLoop]: Abstraction has 5272 states and 9723 transitions. [2024-11-09 19:23:44,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5272 states and 9723 transitions. [2024-11-09 19:23:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 19:23:44,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:44,394 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:23:44,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:23:44,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1092881582, now seen corresponding path program 1 times [2024-11-09 19:23:44,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:44,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456083201] [2024-11-09 19:23:44,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:23:44,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456083201] [2024-11-09 19:23:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456083201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:44,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:44,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:44,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960249399] [2024-11-09 19:23:44,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:44,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:44,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:44,564 INFO L87 Difference]: Start difference. First operand 5272 states and 9723 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:45,301 INFO L93 Difference]: Finished difference Result 12031 states and 22406 transitions. [2024-11-09 19:23:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 227 [2024-11-09 19:23:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:45,319 INFO L225 Difference]: With dead ends: 12031 [2024-11-09 19:23:45,320 INFO L226 Difference]: Without dead ends: 6946 [2024-11-09 19:23:45,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:45,327 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 280 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:45,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 514 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:23:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2024-11-09 19:23:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6937. [2024-11-09 19:23:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6937 states, 6936 states have (on average 1.830594002306805) internal successors, (12697), 6936 states have internal predecessors, (12697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 12697 transitions. [2024-11-09 19:23:45,418 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 12697 transitions. Word has length 227 [2024-11-09 19:23:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:45,419 INFO L471 AbstractCegarLoop]: Abstraction has 6937 states and 12697 transitions. [2024-11-09 19:23:45,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 12697 transitions. [2024-11-09 19:23:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-09 19:23:45,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:45,423 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:23:45,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:23:45,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash 483855264, now seen corresponding path program 1 times [2024-11-09 19:23:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090393742] [2024-11-09 19:23:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090393742] [2024-11-09 19:23:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090393742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 19:23:46,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333762092] [2024-11-09 19:23:46,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:46,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 19:23:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 19:23:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:23:46,011 INFO L87 Difference]: Start difference. First operand 6937 states and 12697 transitions. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:47,890 INFO L93 Difference]: Finished difference Result 14480 states and 26483 transitions. [2024-11-09 19:23:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 19:23:47,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 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 280 [2024-11-09 19:23:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:47,923 INFO L225 Difference]: With dead ends: 14480 [2024-11-09 19:23:47,923 INFO L226 Difference]: Without dead ends: 7915 [2024-11-09 19:23:47,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:23:47,930 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1008 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:47,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 195 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:23:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7915 states. [2024-11-09 19:23:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7915 to 7861. [2024-11-09 19:23:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7861 states, 7860 states have (on average 1.8183206106870229) internal successors, (14292), 7860 states have internal predecessors, (14292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 14292 transitions. [2024-11-09 19:23:48,021 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 14292 transitions. Word has length 280 [2024-11-09 19:23:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:48,022 INFO L471 AbstractCegarLoop]: Abstraction has 7861 states and 14292 transitions. [2024-11-09 19:23:48,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 14292 transitions. [2024-11-09 19:23:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-09 19:23:48,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:48,026 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:23:48,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:23:48,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash -424891797, now seen corresponding path program 1 times [2024-11-09 19:23:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910562919] [2024-11-09 19:23:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-09 19:23:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:48,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910562919] [2024-11-09 19:23:48,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910562919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:48,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:48,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639150811] [2024-11-09 19:23:48,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:48,184 INFO L87 Difference]: Start difference. First operand 7861 states and 14292 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:48,919 INFO L93 Difference]: Finished difference Result 16641 states and 30658 transitions. [2024-11-09 19:23:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:48,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 285 [2024-11-09 19:23:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:48,934 INFO L225 Difference]: With dead ends: 16641 [2024-11-09 19:23:48,934 INFO L226 Difference]: Without dead ends: 9894 [2024-11-09 19:23:48,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:48,941 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 311 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:48,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 449 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:23:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2024-11-09 19:23:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9523. [2024-11-09 19:23:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9523 states, 9522 states have (on average 1.825981936567948) internal successors, (17387), 9522 states have internal predecessors, (17387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9523 states to 9523 states and 17387 transitions. [2024-11-09 19:23:49,038 INFO L78 Accepts]: Start accepts. Automaton has 9523 states and 17387 transitions. Word has length 285 [2024-11-09 19:23:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:49,039 INFO L471 AbstractCegarLoop]: Abstraction has 9523 states and 17387 transitions. [2024-11-09 19:23:49,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9523 states and 17387 transitions. [2024-11-09 19:23:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-09 19:23:49,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:49,066 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:23:49,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:23:49,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1609539655, now seen corresponding path program 1 times [2024-11-09 19:23:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:49,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937767995] [2024-11-09 19:23:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 19:23:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937767995] [2024-11-09 19:23:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937767995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835778148] [2024-11-09 19:23:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:49,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:49,189 INFO L87 Difference]: Start difference. First operand 9523 states and 17387 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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-09 19:23:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:49,909 INFO L93 Difference]: Finished difference Result 22374 states and 41392 transitions. [2024-11-09 19:23:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:49,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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 305 [2024-11-09 19:23:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:49,929 INFO L225 Difference]: With dead ends: 22374 [2024-11-09 19:23:49,930 INFO L226 Difference]: Without dead ends: 13223 [2024-11-09 19:23:49,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:49,940 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 295 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:49,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 455 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:23:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13223 states. [2024-11-09 19:23:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13223 to 13223. [2024-11-09 19:23:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13223 states, 13222 states have (on average 1.816971713810316) internal successors, (24024), 13222 states have internal predecessors, (24024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13223 states to 13223 states and 24024 transitions. [2024-11-09 19:23:50,113 INFO L78 Accepts]: Start accepts. Automaton has 13223 states and 24024 transitions. Word has length 305 [2024-11-09 19:23:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:50,113 INFO L471 AbstractCegarLoop]: Abstraction has 13223 states and 24024 transitions. [2024-11-09 19:23:50,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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-09 19:23:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 13223 states and 24024 transitions. [2024-11-09 19:23:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-09 19:23:50,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:50,122 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:50,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:23:50,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:50,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2074817711, now seen corresponding path program 1 times [2024-11-09 19:23:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:50,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372804210] [2024-11-09 19:23:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:50,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-09 19:23:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372804210] [2024-11-09 19:23:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372804210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303114822] [2024-11-09 19:23:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:50,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:50,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:50,246 INFO L87 Difference]: Start difference. First operand 13223 states and 24024 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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-09 19:23:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:51,031 INFO L93 Difference]: Finished difference Result 26996 states and 49388 transitions. [2024-11-09 19:23:51,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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 333 [2024-11-09 19:23:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:51,050 INFO L225 Difference]: With dead ends: 26996 [2024-11-09 19:23:51,051 INFO L226 Difference]: Without dead ends: 15257 [2024-11-09 19:23:51,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:51,062 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 305 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:51,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 156 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:23:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15257 states. [2024-11-09 19:23:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15257 to 13771. [2024-11-09 19:23:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13771 states, 13770 states have (on average 1.7995642701525054) internal successors, (24780), 13770 states have internal predecessors, (24780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13771 states to 13771 states and 24780 transitions. [2024-11-09 19:23:51,197 INFO L78 Accepts]: Start accepts. Automaton has 13771 states and 24780 transitions. Word has length 333 [2024-11-09 19:23:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 13771 states and 24780 transitions. [2024-11-09 19:23:51,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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-09 19:23:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13771 states and 24780 transitions. [2024-11-09 19:23:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-09 19:23:51,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:51,206 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:23:51,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:23:51,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:51,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -616511258, now seen corresponding path program 1 times [2024-11-09 19:23:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327797026] [2024-11-09 19:23:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:23:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327797026] [2024-11-09 19:23:51,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327797026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:23:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706387404] [2024-11-09 19:23:51,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:51,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:23:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:23:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:51,483 INFO L87 Difference]: Start difference. First operand 13771 states and 24780 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 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-09 19:23:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:52,734 INFO L93 Difference]: Finished difference Result 31817 states and 57767 transitions. [2024-11-09 19:23:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:23:52,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 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 344 [2024-11-09 19:23:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:52,754 INFO L225 Difference]: With dead ends: 31817 [2024-11-09 19:23:52,754 INFO L226 Difference]: Without dead ends: 19530 [2024-11-09 19:23:52,765 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-09 19:23:52,766 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 494 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:52,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 74 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:23:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2024-11-09 19:23:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 18030. [2024-11-09 19:23:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18030 states, 18029 states have (on average 1.805535526096844) internal successors, (32552), 18029 states have internal predecessors, (32552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18030 states to 18030 states and 32552 transitions. [2024-11-09 19:23:53,036 INFO L78 Accepts]: Start accepts. Automaton has 18030 states and 32552 transitions. Word has length 344 [2024-11-09 19:23:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:53,037 INFO L471 AbstractCegarLoop]: Abstraction has 18030 states and 32552 transitions. [2024-11-09 19:23:53,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 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-09 19:23:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 18030 states and 32552 transitions. [2024-11-09 19:23:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-09 19:23:53,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:53,053 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:23:53,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:23:53,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash -806003703, now seen corresponding path program 1 times [2024-11-09 19:23:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420100605] [2024-11-09 19:23:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 19:23:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:53,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420100605] [2024-11-09 19:23:53,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420100605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:53,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:53,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:23:53,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011096177] [2024-11-09 19:23:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:53,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:23:53,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:53,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:23:53,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:23:53,615 INFO L87 Difference]: Start difference. First operand 18030 states and 32552 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:54,755 INFO L93 Difference]: Finished difference Result 38481 states and 69947 transitions. [2024-11-09 19:23:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:23:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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 419 [2024-11-09 19:23:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:54,778 INFO L225 Difference]: With dead ends: 38481 [2024-11-09 19:23:54,778 INFO L226 Difference]: Without dead ends: 21935 [2024-11-09 19:23:54,791 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-09 19:23:54,792 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 494 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:54,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 74 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:23:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states. [2024-11-09 19:23:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 17660. [2024-11-09 19:23:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17660 states, 17659 states have (on average 1.8072371028937086) internal successors, (31914), 17659 states have internal predecessors, (31914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17660 states to 17660 states and 31914 transitions. [2024-11-09 19:23:55,021 INFO L78 Accepts]: Start accepts. Automaton has 17660 states and 31914 transitions. Word has length 419 [2024-11-09 19:23:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:55,021 INFO L471 AbstractCegarLoop]: Abstraction has 17660 states and 31914 transitions. [2024-11-09 19:23:55,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 17660 states and 31914 transitions. [2024-11-09 19:23:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-11-09 19:23:55,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:55,044 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:55,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:23:55,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:55,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash 915993290, now seen corresponding path program 1 times [2024-11-09 19:23:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873862553] [2024-11-09 19:23:55,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 813 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2024-11-09 19:23:55,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:55,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873862553] [2024-11-09 19:23:55,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873862553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:55,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:55,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119239999] [2024-11-09 19:23:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:55,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:55,319 INFO L87 Difference]: Start difference. First operand 17660 states and 31914 transitions. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:55,940 INFO L93 Difference]: Finished difference Result 32165 states and 58180 transitions. [2024-11-09 19:23:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 594 [2024-11-09 19:23:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:55,956 INFO L225 Difference]: With dead ends: 32165 [2024-11-09 19:23:55,957 INFO L226 Difference]: Without dead ends: 15989 [2024-11-09 19:23:55,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:55,967 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 222 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:55,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 150 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:23:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15989 states. [2024-11-09 19:23:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15989 to 14137. [2024-11-09 19:23:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14137 states, 14136 states have (on average 1.7649971703452179) internal successors, (24950), 14136 states have internal predecessors, (24950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 24950 transitions. [2024-11-09 19:23:56,212 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 24950 transitions. Word has length 594 [2024-11-09 19:23:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:56,212 INFO L471 AbstractCegarLoop]: Abstraction has 14137 states and 24950 transitions. [2024-11-09 19:23:56,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 24950 transitions. [2024-11-09 19:23:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2024-11-09 19:23:56,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:23:56,238 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2024-11-09 19:23:56,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:23:56,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:23:56,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:23:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash -207703566, now seen corresponding path program 1 times [2024-11-09 19:23:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:23:56,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952650028] [2024-11-09 19:23:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:23:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:23:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:23:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 894 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-09 19:23:56,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:23:56,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952650028] [2024-11-09 19:23:56,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952650028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:23:56,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:23:56,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:23:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504423505] [2024-11-09 19:23:56,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:23:56,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:23:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:23:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:23:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:56,687 INFO L87 Difference]: Start difference. First operand 14137 states and 24950 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:23:57,347 INFO L93 Difference]: Finished difference Result 28266 states and 50066 transitions. [2024-11-09 19:23:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:23:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 758 [2024-11-09 19:23:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:23:57,348 INFO L225 Difference]: With dead ends: 28266 [2024-11-09 19:23:57,348 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:23:57,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:23:57,358 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 317 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:23:57,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 476 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:23:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:23:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:23:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:23:57,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 758 [2024-11-09 19:23:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:23:57,359 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:23:57,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:23:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:23:57,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:23:57,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:23:57,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:23:57,364 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:23:57,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:23:58,548 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:23:58,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:23:58 BoogieIcfgContainer [2024-11-09 19:23:58,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:23:58,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:23:58,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:23:58,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:23:58,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:23:37" (3/4) ... [2024-11-09 19:23:58,559 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:23:58,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:23:58,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:23:58,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:23:58,585 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:23:58,726 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:23:58,726 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:23:58,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:23:58,727 INFO L158 Benchmark]: Toolchain (without parser) took 23759.40ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 95.2MB in the beginning and 812.6MB in the end (delta: -717.5MB). Peak memory consumption was 445.8MB. Max. memory is 16.1GB. [2024-11-09 19:23:58,727 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:23:58,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.59ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 100.4MB in the end (delta: -5.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-09 19:23:58,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.44ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 83.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:23:58,728 INFO L158 Benchmark]: Boogie Preprocessor took 107.10ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 58.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 19:23:58,729 INFO L158 Benchmark]: IcfgBuilder took 1508.38ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 58.4MB in the beginning and 167.8MB in the end (delta: -109.4MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-09 19:23:58,729 INFO L158 Benchmark]: TraceAbstraction took 21322.02ms. Allocated memory was 245.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 166.7MB in the beginning and 833.6MB in the end (delta: -666.9MB). Peak memory consumption was 916.5MB. Max. memory is 16.1GB. [2024-11-09 19:23:58,729 INFO L158 Benchmark]: Witness Printer took 169.50ms. Allocated memory is still 1.3GB. Free memory was 833.6MB in the beginning and 812.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 19:23:58,730 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.11ms. Allocated memory is still 167.8MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.59ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 100.4MB in the end (delta: -5.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.44ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 83.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.10ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 58.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1508.38ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 58.4MB in the beginning and 167.8MB in the end (delta: -109.4MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21322.02ms. Allocated memory was 245.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 166.7MB in the beginning and 833.6MB in the end (delta: -666.9MB). Peak memory consumption was 916.5MB. Max. memory is 16.1GB. * Witness Printer took 169.50ms. Allocated memory is still 1.3GB. Free memory was 833.6MB in the beginning and 812.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5642 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5642 mSDsluCounter, 3838 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 2123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15774 IncrementalHoareTripleChecker+Invalid, 17897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2123 mSolverCounterUnsat, 3366 mSDtfsCounter, 15774 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18030occurred in iteration=12, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 9576 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 4332 NumberOfCodeBlocks, 4332 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4317 ConstructedInterpolants, 0 QuantifiedInterpolants, 10517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 4729/4729 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:23:58,756 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