./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label39.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 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:40:37,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:40:37,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:40:37,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:40:37,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:40:37,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:40:37,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:40:37,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:40:37,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:40:37,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:40:37,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:40:37,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:40:37,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:40:37,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:40:37,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:40:37,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:40:37,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:40:37,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:40:37,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:40:37,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:40:37,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:40:37,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:40:37,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:40:37,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:40:37,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:40:37,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:40:37,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:40:37,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:40:37,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:40:37,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:40:37,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:40:37,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:40:37,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:40:37,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:40:37,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:40:37,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:40:37,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:40:37,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:40:37,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:40:37,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:40:37,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:40:37,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:40:37,877 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c [2024-11-08 11:40:38,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:40:38,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:40:38,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:40:38,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:40:38,085 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:40:38,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-11-08 11:40:39,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:40:39,736 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:40:39,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-11-08 11:40:39,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4a97cc4/6377032db7ca4275b730fb4849cc20e5/FLAG56794861b [2024-11-08 11:40:40,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4a97cc4/6377032db7ca4275b730fb4849cc20e5 [2024-11-08 11:40:40,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:40:40,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:40:40,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:40:40,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:40:40,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:40:40,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:40:40" (1/1) ... [2024-11-08 11:40:40,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f7bc49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:40, skipping insertion in model container [2024-11-08 11:40:40,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:40:40" (1/1) ... [2024-11-08 11:40:40,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:40:40,443 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/Problem17_label39.c[9366,9379] [2024-11-08 11:40:40,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:40:40,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:40:40,852 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/Problem17_label39.c[9366,9379] [2024-11-08 11:40:41,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:40:41,109 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:40:41,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41 WrapperNode [2024-11-08 11:40:41,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:40:41,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:40:41,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:40:41,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:40:41,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,271 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-08 11:40:41,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:40:41,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:40:41,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:40:41,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:40:41,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,518 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:40:41,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:40:41,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:40:41,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:40:41,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:40:41,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (1/1) ... [2024-11-08 11:40:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:40:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:40:41,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:40:41,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:40:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:40:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:40:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:40:41,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:40:41,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:40:41,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:40:44,306 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-08 11:40:44,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:40:44,328 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:40:44,328 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:40:44,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:44 BoogieIcfgContainer [2024-11-08 11:40:44,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:40:44,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:40:44,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:40:44,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:40:44,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:40:40" (1/3) ... [2024-11-08 11:40:44,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a85c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:40:44, skipping insertion in model container [2024-11-08 11:40:44,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:41" (2/3) ... [2024-11-08 11:40:44,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a85c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:40:44, skipping insertion in model container [2024-11-08 11:40:44,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:44" (3/3) ... [2024-11-08 11:40:44,335 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2024-11-08 11:40:44,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:40:44,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:40:44,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:40:44,414 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;@7161719c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:40:44,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:40:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 11:40:44,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:44,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:40:44,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:44,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash -696204111, now seen corresponding path program 1 times [2024-11-08 11:40:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012072542] [2024-11-08 11:40:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:40:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:44,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012072542] [2024-11-08 11:40:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012072542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:44,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:40:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808523707] [2024-11-08 11:40:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:44,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:44,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:44,720 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 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 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:47,148 INFO L93 Difference]: Finished difference Result 1642 states and 3024 transitions. [2024-11-08 11:40:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-08 11:40:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:47,167 INFO L225 Difference]: With dead ends: 1642 [2024-11-08 11:40:47,167 INFO L226 Difference]: Without dead ends: 975 [2024-11-08 11:40:47,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:47,174 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 427 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:47,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:40:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-08 11:40:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2024-11-08 11:40:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2024-11-08 11:40:47,254 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 63 [2024-11-08 11:40:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:47,255 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2024-11-08 11:40:47,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2024-11-08 11:40:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 11:40:47,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:47,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:40:47,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:40:47,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:47,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1757507228, now seen corresponding path program 1 times [2024-11-08 11:40:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:47,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989786958] [2024-11-08 11:40:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:47,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:40:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989786958] [2024-11-08 11:40:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989786958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:40:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449939565] [2024-11-08 11:40:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:47,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:47,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:47,671 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:49,451 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2024-11-08 11:40:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-08 11:40:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:49,457 INFO L225 Difference]: With dead ends: 2814 [2024-11-08 11:40:49,457 INFO L226 Difference]: Without dead ends: 1844 [2024-11-08 11:40:49,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:49,459 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 428 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:49,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 11:40:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-08 11:40:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2024-11-08 11:40:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2024-11-08 11:40:49,487 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 133 [2024-11-08 11:40:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:49,488 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2024-11-08 11:40:49,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2024-11-08 11:40:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 11:40:49,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:49,490 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 11:40:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:40:49,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:49,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash 709411297, now seen corresponding path program 1 times [2024-11-08 11:40:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337039406] [2024-11-08 11:40:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:40:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337039406] [2024-11-08 11:40:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337039406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:40:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751245246] [2024-11-08 11:40:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:49,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:49,627 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:51,196 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2024-11-08 11:40:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-11-08 11:40:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:51,208 INFO L225 Difference]: With dead ends: 5395 [2024-11-08 11:40:51,215 INFO L226 Difference]: Without dead ends: 2701 [2024-11-08 11:40:51,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:51,218 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:51,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:40:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2024-11-08 11:40:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2024-11-08 11:40:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2024-11-08 11:40:51,327 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 155 [2024-11-08 11:40:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:51,328 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2024-11-08 11:40:51,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2024-11-08 11:40:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 11:40:51,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:51,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:40:51,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:40:51,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:51,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1764789618, now seen corresponding path program 1 times [2024-11-08 11:40:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:51,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660918824] [2024-11-08 11:40:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:40:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:51,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660918824] [2024-11-08 11:40:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660918824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:51,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:51,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:40:51,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78152497] [2024-11-08 11:40:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:51,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:51,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:51,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:51,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:51,573 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:52,909 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2024-11-08 11:40:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-08 11:40:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:52,930 INFO L225 Difference]: With dead ends: 7108 [2024-11-08 11:40:52,931 INFO L226 Difference]: Without dead ends: 4409 [2024-11-08 11:40:52,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:52,940 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:52,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:40:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2024-11-08 11:40:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2024-11-08 11:40:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2024-11-08 11:40:53,012 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 215 [2024-11-08 11:40:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:53,012 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2024-11-08 11:40:53,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2024-11-08 11:40:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 11:40:53,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:53,014 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:40:53,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:40:53,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:53,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1819194189, now seen corresponding path program 1 times [2024-11-08 11:40:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:53,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474671289] [2024-11-08 11:40:53,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:53,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 11:40:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474671289] [2024-11-08 11:40:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474671289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:53,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:40:53,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256460625] [2024-11-08 11:40:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:53,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:53,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:53,147 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:54,533 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2024-11-08 11:40:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 217 [2024-11-08 11:40:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:54,559 INFO L225 Difference]: With dead ends: 10936 [2024-11-08 11:40:54,560 INFO L226 Difference]: Without dead ends: 6528 [2024-11-08 11:40:54,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:54,566 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 388 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:54,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:40:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2024-11-08 11:40:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2024-11-08 11:40:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2024-11-08 11:40:54,622 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 217 [2024-11-08 11:40:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:54,623 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2024-11-08 11:40:54,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2024-11-08 11:40:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 11:40:54,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:54,626 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:40:54,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:40:54,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:54,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1644382419, now seen corresponding path program 1 times [2024-11-08 11:40:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:54,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310955112] [2024-11-08 11:40:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:40:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310955112] [2024-11-08 11:40:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310955112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:54,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:54,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:40:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428302023] [2024-11-08 11:40:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:54,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:54,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:54,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:54,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:54,834 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:56,286 INFO L93 Difference]: Finished difference Result 10045 states and 11706 transitions. [2024-11-08 11:40:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:56,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 283 [2024-11-08 11:40:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:56,302 INFO L225 Difference]: With dead ends: 10045 [2024-11-08 11:40:56,302 INFO L226 Difference]: Without dead ends: 5665 [2024-11-08 11:40:56,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:56,306 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 373 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:56,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:40:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2024-11-08 11:40:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234. [2024-11-08 11:40:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions. [2024-11-08 11:40:56,356 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 283 [2024-11-08 11:40:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:56,357 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions. [2024-11-08 11:40:56,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions. [2024-11-08 11:40:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-08 11:40:56,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:56,360 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:40:56,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:40:56,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:56,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash 715443249, now seen corresponding path program 1 times [2024-11-08 11:40:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476993136] [2024-11-08 11:40:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-08 11:40:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:56,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476993136] [2024-11-08 11:40:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476993136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:56,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:40:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301553660] [2024-11-08 11:40:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:56,608 INFO L87 Difference]: Start difference. First operand 5234 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:58,099 INFO L93 Difference]: Finished difference Result 12593 states and 14783 transitions. [2024-11-08 11:40:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:58,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 295 [2024-11-08 11:40:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:58,117 INFO L225 Difference]: With dead ends: 12593 [2024-11-08 11:40:58,118 INFO L226 Difference]: Without dead ends: 6936 [2024-11-08 11:40:58,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:40:58,122 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:58,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:40:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2024-11-08 11:40:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6936. [2024-11-08 11:40:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6936 states, 6935 states have (on average 1.1322278298485942) internal successors, (7852), 6935 states have internal predecessors, (7852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 7852 transitions. [2024-11-08 11:40:58,187 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 7852 transitions. Word has length 295 [2024-11-08 11:40:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:58,187 INFO L471 AbstractCegarLoop]: Abstraction has 6936 states and 7852 transitions. [2024-11-08 11:40:58,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:40:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 7852 transitions. [2024-11-08 11:40:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-08 11:40:58,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:58,191 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 11:40:58,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:40:58,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:58,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 403479436, now seen corresponding path program 1 times [2024-11-08 11:40:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038148874] [2024-11-08 11:40:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:40:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038148874] [2024-11-08 11:40:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038148874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:58,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:40:58,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:40:58,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160206713] [2024-11-08 11:40:58,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:58,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:40:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:40:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:40:58,569 INFO L87 Difference]: Start difference. First operand 6936 states and 7852 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:00,713 INFO L93 Difference]: Finished difference Result 21980 states and 24837 transitions. [2024-11-08 11:41:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:41:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2024-11-08 11:41:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:00,739 INFO L225 Difference]: With dead ends: 21980 [2024-11-08 11:41:00,742 INFO L226 Difference]: Without dead ends: 15046 [2024-11-08 11:41:00,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:00,763 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 829 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:00,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 215 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:41:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15046 states. [2024-11-08 11:41:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15046 to 13337. [2024-11-08 11:41:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13337 states, 13336 states have (on average 1.1339232153569285) internal successors, (15122), 13336 states have internal predecessors, (15122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13337 states to 13337 states and 15122 transitions. [2024-11-08 11:41:01,061 INFO L78 Accepts]: Start accepts. Automaton has 13337 states and 15122 transitions. Word has length 335 [2024-11-08 11:41:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:01,062 INFO L471 AbstractCegarLoop]: Abstraction has 13337 states and 15122 transitions. [2024-11-08 11:41:01,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 13337 states and 15122 transitions. [2024-11-08 11:41:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-08 11:41:01,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:01,072 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:01,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:41:01,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2069690024, now seen corresponding path program 1 times [2024-11-08 11:41:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:01,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383016225] [2024-11-08 11:41:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:41:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383016225] [2024-11-08 11:41:01,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383016225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:41:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789123271] [2024-11-08 11:41:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:01,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:41:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:01,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:41:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:01,309 INFO L87 Difference]: Start difference. First operand 13337 states and 15122 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:03,038 INFO L93 Difference]: Finished difference Result 35223 states and 39901 transitions. [2024-11-08 11:41:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:41:03,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 352 [2024-11-08 11:41:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:03,064 INFO L225 Difference]: With dead ends: 35223 [2024-11-08 11:41:03,065 INFO L226 Difference]: Without dead ends: 21888 [2024-11-08 11:41:03,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:03,074 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 438 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:03,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 820 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:41:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2024-11-08 11:41:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 21015. [2024-11-08 11:41:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21015 states, 21014 states have (on average 1.117493099838203) internal successors, (23483), 21014 states have internal predecessors, (23483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21015 states to 21015 states and 23483 transitions. [2024-11-08 11:41:03,260 INFO L78 Accepts]: Start accepts. Automaton has 21015 states and 23483 transitions. Word has length 352 [2024-11-08 11:41:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 21015 states and 23483 transitions. [2024-11-08 11:41:03,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 21015 states and 23483 transitions. [2024-11-08 11:41:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-08 11:41:03,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:03,268 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 11:41:03,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:41:03,269 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:03,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:03,269 INFO L85 PathProgramCache]: Analyzing trace with hash 56522163, now seen corresponding path program 1 times [2024-11-08 11:41:03,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:03,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748583373] [2024-11-08 11:41:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-08 11:41:03,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:03,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748583373] [2024-11-08 11:41:03,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748583373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:03,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:41:03,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850853205] [2024-11-08 11:41:03,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:03,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:41:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:03,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:41:03,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:03,425 INFO L87 Difference]: Start difference. First operand 21015 states and 23483 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:04,229 INFO L93 Difference]: Finished difference Result 42013 states and 46949 transitions. [2024-11-08 11:41:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:41:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 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 361 [2024-11-08 11:41:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:04,256 INFO L225 Difference]: With dead ends: 42013 [2024-11-08 11:41:04,257 INFO L226 Difference]: Without dead ends: 21000 [2024-11-08 11:41:04,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:04,274 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 669 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:04,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 122 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:41:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21000 states. [2024-11-08 11:41:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21000 to 20995. [2024-11-08 11:41:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20995 states, 20994 states have (on average 1.1166523768695817) internal successors, (23443), 20994 states have internal predecessors, (23443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20995 states to 20995 states and 23443 transitions. [2024-11-08 11:41:04,434 INFO L78 Accepts]: Start accepts. Automaton has 20995 states and 23443 transitions. Word has length 361 [2024-11-08 11:41:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:04,435 INFO L471 AbstractCegarLoop]: Abstraction has 20995 states and 23443 transitions. [2024-11-08 11:41:04,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20995 states and 23443 transitions. [2024-11-08 11:41:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-08 11:41:04,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:04,543 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 11:41:04,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:41:04,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:04,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash -352479738, now seen corresponding path program 1 times [2024-11-08 11:41:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877382313] [2024-11-08 11:41:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:04,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-08 11:41:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877382313] [2024-11-08 11:41:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877382313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:04,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:41:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077464970] [2024-11-08 11:41:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:04,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:41:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:41:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:04,777 INFO L87 Difference]: Start difference. First operand 20995 states and 23443 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:06,488 INFO L93 Difference]: Finished difference Result 48384 states and 54183 transitions. [2024-11-08 11:41:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:41:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 378 [2024-11-08 11:41:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:06,517 INFO L225 Difference]: With dead ends: 48384 [2024-11-08 11:41:06,517 INFO L226 Difference]: Without dead ends: 27391 [2024-11-08 11:41:06,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:06,534 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 444 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:06,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 255 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:41:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27391 states. [2024-11-08 11:41:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27391 to 25235. [2024-11-08 11:41:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25235 states, 25234 states have (on average 1.125782674169771) internal successors, (28408), 25234 states have internal predecessors, (28408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25235 states to 25235 states and 28408 transitions. [2024-11-08 11:41:06,756 INFO L78 Accepts]: Start accepts. Automaton has 25235 states and 28408 transitions. Word has length 378 [2024-11-08 11:41:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 25235 states and 28408 transitions. [2024-11-08 11:41:06,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 25235 states and 28408 transitions. [2024-11-08 11:41:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-08 11:41:06,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:06,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:06,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:41:06,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2069008964, now seen corresponding path program 1 times [2024-11-08 11:41:06,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:06,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937711439] [2024-11-08 11:41:06,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:41:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937711439] [2024-11-08 11:41:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937711439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:07,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:07,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:41:07,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6448588] [2024-11-08 11:41:07,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:07,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:41:07,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:41:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:07,279 INFO L87 Difference]: Start difference. First operand 25235 states and 28408 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:09,551 INFO L93 Difference]: Finished difference Result 61555 states and 69146 transitions. [2024-11-08 11:41:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:41:09,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 402 [2024-11-08 11:41:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:09,585 INFO L225 Difference]: With dead ends: 61555 [2024-11-08 11:41:09,585 INFO L226 Difference]: Without dead ends: 35897 [2024-11-08 11:41:09,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:09,606 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 610 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:09,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 199 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:41:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35897 states. [2024-11-08 11:41:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35897 to 35896. [2024-11-08 11:41:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35896 states, 35895 states have (on average 1.1228026187491293) internal successors, (40303), 35895 states have internal predecessors, (40303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35896 states to 35896 states and 40303 transitions. [2024-11-08 11:41:10,227 INFO L78 Accepts]: Start accepts. Automaton has 35896 states and 40303 transitions. Word has length 402 [2024-11-08 11:41:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:10,227 INFO L471 AbstractCegarLoop]: Abstraction has 35896 states and 40303 transitions. [2024-11-08 11:41:10,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 35896 states and 40303 transitions. [2024-11-08 11:41:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-11-08 11:41:10,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:10,235 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:41:10,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:41:10,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:10,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash 61958258, now seen corresponding path program 1 times [2024-11-08 11:41:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991967225] [2024-11-08 11:41:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-08 11:41:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991967225] [2024-11-08 11:41:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991967225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:41:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365107497] [2024-11-08 11:41:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:41:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:41:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:10,448 INFO L87 Difference]: Start difference. First operand 35896 states and 40303 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:12,313 INFO L93 Difference]: Finished difference Result 81168 states and 91136 transitions. [2024-11-08 11:41:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:41:12,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 424 [2024-11-08 11:41:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:12,358 INFO L225 Difference]: With dead ends: 81168 [2024-11-08 11:41:12,358 INFO L226 Difference]: Without dead ends: 45274 [2024-11-08 11:41:12,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:12,376 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 503 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:12,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 224 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 11:41:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45274 states. [2024-11-08 11:41:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45274 to 45258. [2024-11-08 11:41:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45258 states, 45257 states have (on average 1.1104580506882913) internal successors, (50256), 45257 states have internal predecessors, (50256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45258 states to 45258 states and 50256 transitions. [2024-11-08 11:41:13,129 INFO L78 Accepts]: Start accepts. Automaton has 45258 states and 50256 transitions. Word has length 424 [2024-11-08 11:41:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 45258 states and 50256 transitions. [2024-11-08 11:41:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45258 states and 50256 transitions. [2024-11-08 11:41:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-11-08 11:41:13,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:13,143 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:13,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:41:13,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:13,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1067546786, now seen corresponding path program 1 times [2024-11-08 11:41:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:13,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946938457] [2024-11-08 11:41:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 11:41:13,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:13,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946938457] [2024-11-08 11:41:13,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946938457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:13,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:13,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:41:13,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126831457] [2024-11-08 11:41:13,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:13,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:41:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:13,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:41:13,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:13,478 INFO L87 Difference]: Start difference. First operand 45258 states and 50256 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:14,855 INFO L93 Difference]: Finished difference Result 99444 states and 111249 transitions. [2024-11-08 11:41:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:41:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 525 [2024-11-08 11:41:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:14,914 INFO L225 Difference]: With dead ends: 99444 [2024-11-08 11:41:14,914 INFO L226 Difference]: Without dead ends: 52481 [2024-11-08 11:41:14,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:14,942 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 411 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:14,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 763 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:41:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52481 states. [2024-11-08 11:41:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52481 to 52054. [2024-11-08 11:41:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52054 states, 52053 states have (on average 1.104335965266171) internal successors, (57484), 52053 states have internal predecessors, (57484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52054 states to 52054 states and 57484 transitions. [2024-11-08 11:41:15,543 INFO L78 Accepts]: Start accepts. Automaton has 52054 states and 57484 transitions. Word has length 525 [2024-11-08 11:41:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:15,544 INFO L471 AbstractCegarLoop]: Abstraction has 52054 states and 57484 transitions. [2024-11-08 11:41:15,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 52054 states and 57484 transitions. [2024-11-08 11:41:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-11-08 11:41:15,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:15,558 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:15,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:41:15,558 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 742987499, now seen corresponding path program 1 times [2024-11-08 11:41:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867529351] [2024-11-08 11:41:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:41:16,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867529351] [2024-11-08 11:41:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867529351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:41:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516710117] [2024-11-08 11:41:16,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:16,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:41:16,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:41:16,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:41:16,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:41:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:16,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 11:41:16,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:41:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:41:17,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:41:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:41:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516710117] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:41:17,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:41:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2024-11-08 11:41:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224347296] [2024-11-08 11:41:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:17,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 11:41:17,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:17,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 11:41:17,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:41:17,802 INFO L87 Difference]: Start difference. First operand 52054 states and 57484 transitions. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:21,112 INFO L93 Difference]: Finished difference Result 146297 states and 161539 transitions. [2024-11-08 11:41:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 11:41:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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 548 [2024-11-08 11:41:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:21,202 INFO L225 Difference]: With dead ends: 146297 [2024-11-08 11:41:21,203 INFO L226 Difference]: Without dead ends: 91267 [2024-11-08 11:41:21,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:41:21,349 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1127 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 1040 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:21,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 177 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 2692 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:41:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91267 states. [2024-11-08 11:41:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91267 to 75076. [2024-11-08 11:41:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75076 states, 75075 states have (on average 1.100979020979021) internal successors, (82656), 75075 states have internal predecessors, (82656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75076 states to 75076 states and 82656 transitions. [2024-11-08 11:41:22,260 INFO L78 Accepts]: Start accepts. Automaton has 75076 states and 82656 transitions. Word has length 548 [2024-11-08 11:41:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:22,261 INFO L471 AbstractCegarLoop]: Abstraction has 75076 states and 82656 transitions. [2024-11-08 11:41:22,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 75076 states and 82656 transitions. [2024-11-08 11:41:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2024-11-08 11:41:22,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:22,283 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 11:41:22,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:41:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 11:41:22,485 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:22,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1163887151, now seen corresponding path program 1 times [2024-11-08 11:41:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207755748] [2024-11-08 11:41:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-08 11:41:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:22,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207755748] [2024-11-08 11:41:22,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207755748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:22,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:22,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:41:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881015137] [2024-11-08 11:41:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:22,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:41:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:41:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:22,861 INFO L87 Difference]: Start difference. First operand 75076 states and 82656 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:24,581 INFO L93 Difference]: Finished difference Result 144122 states and 158277 transitions. [2024-11-08 11:41:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:41:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 577 [2024-11-08 11:41:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:24,672 INFO L225 Difference]: With dead ends: 144122 [2024-11-08 11:41:24,672 INFO L226 Difference]: Without dead ends: 64367 [2024-11-08 11:41:24,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:24,723 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 421 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:24,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 633 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:41:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64367 states. [2024-11-08 11:41:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64367 to 64363. [2024-11-08 11:41:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64363 states, 64362 states have (on average 1.0824088748019018) internal successors, (69666), 64362 states have internal predecessors, (69666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64363 states to 64363 states and 69666 transitions. [2024-11-08 11:41:25,765 INFO L78 Accepts]: Start accepts. Automaton has 64363 states and 69666 transitions. Word has length 577 [2024-11-08 11:41:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:25,765 INFO L471 AbstractCegarLoop]: Abstraction has 64363 states and 69666 transitions. [2024-11-08 11:41:25,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 64363 states and 69666 transitions. [2024-11-08 11:41:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2024-11-08 11:41:25,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:25,793 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:25,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:41:25,797 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:25,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1859172721, now seen corresponding path program 1 times [2024-11-08 11:41:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:25,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864029419] [2024-11-08 11:41:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2024-11-08 11:41:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864029419] [2024-11-08 11:41:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864029419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:26,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:26,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:41:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710919941] [2024-11-08 11:41:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:26,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:41:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:41:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:26,637 INFO L87 Difference]: Start difference. First operand 64363 states and 69666 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:28,301 INFO L93 Difference]: Finished difference Result 134668 states and 145794 transitions. [2024-11-08 11:41:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:41:28,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 797 [2024-11-08 11:41:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:28,385 INFO L225 Difference]: With dead ends: 134668 [2024-11-08 11:41:28,385 INFO L226 Difference]: Without dead ends: 67756 [2024-11-08 11:41:28,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:41:28,416 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 443 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:28,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 717 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:41:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67756 states. [2024-11-08 11:41:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67756 to 63928. [2024-11-08 11:41:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63928 states, 63927 states have (on average 1.0723325042626746) internal successors, (68551), 63927 states have internal predecessors, (68551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63928 states to 63928 states and 68551 transitions. [2024-11-08 11:41:29,449 INFO L78 Accepts]: Start accepts. Automaton has 63928 states and 68551 transitions. Word has length 797 [2024-11-08 11:41:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:29,450 INFO L471 AbstractCegarLoop]: Abstraction has 63928 states and 68551 transitions. [2024-11-08 11:41:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 63928 states and 68551 transitions. [2024-11-08 11:41:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2024-11-08 11:41:29,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:29,505 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:41:29,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1682408212, now seen corresponding path program 1 times [2024-11-08 11:41:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:29,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412689936] [2024-11-08 11:41:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 1154 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-08 11:41:30,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:30,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412689936] [2024-11-08 11:41:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412689936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:41:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892145790] [2024-11-08 11:41:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:41:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:41:30,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:30,767 INFO L87 Difference]: Start difference. First operand 63928 states and 68551 transitions. Second operand has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:32,856 INFO L93 Difference]: Finished difference Result 131261 states and 140856 transitions. [2024-11-08 11:41:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:41:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 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 939 [2024-11-08 11:41:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:32,928 INFO L225 Difference]: With dead ends: 131261 [2024-11-08 11:41:32,928 INFO L226 Difference]: Without dead ends: 67335 [2024-11-08 11:41:32,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:32,946 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 653 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:32,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 130 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:41:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67335 states. [2024-11-08 11:41:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67335 to 63078. [2024-11-08 11:41:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63078 states, 63077 states have (on average 1.070897474515275) internal successors, (67549), 63077 states have internal predecessors, (67549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63078 states to 63078 states and 67549 transitions. [2024-11-08 11:41:33,761 INFO L78 Accepts]: Start accepts. Automaton has 63078 states and 67549 transitions. Word has length 939 [2024-11-08 11:41:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:33,761 INFO L471 AbstractCegarLoop]: Abstraction has 63078 states and 67549 transitions. [2024-11-08 11:41:33,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 63078 states and 67549 transitions. [2024-11-08 11:41:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-11-08 11:41:34,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:34,150 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:34,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:41:34,150 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:34,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1435722262, now seen corresponding path program 1 times [2024-11-08 11:41:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784598895] [2024-11-08 11:41:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-08 11:41:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784598895] [2024-11-08 11:41:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784598895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:35,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:35,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:41:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994819376] [2024-11-08 11:41:35,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:35,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:41:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:41:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:35,095 INFO L87 Difference]: Start difference. First operand 63078 states and 67549 transitions. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:37,165 INFO L93 Difference]: Finished difference Result 129538 states and 138708 transitions. [2024-11-08 11:41:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:41:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 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 955 [2024-11-08 11:41:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:37,246 INFO L225 Difference]: With dead ends: 129538 [2024-11-08 11:41:37,246 INFO L226 Difference]: Without dead ends: 66462 [2024-11-08 11:41:37,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:37,274 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 815 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:37,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 280 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 11:41:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66462 states. [2024-11-08 11:41:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66462 to 63905. [2024-11-08 11:41:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63905 states, 63904 states have (on average 1.0638301201802705) internal successors, (67983), 63904 states have internal predecessors, (67983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63905 states to 63905 states and 67983 transitions. [2024-11-08 11:41:38,167 INFO L78 Accepts]: Start accepts. Automaton has 63905 states and 67983 transitions. Word has length 955 [2024-11-08 11:41:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:38,168 INFO L471 AbstractCegarLoop]: Abstraction has 63905 states and 67983 transitions. [2024-11-08 11:41:38,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 63905 states and 67983 transitions. [2024-11-08 11:41:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2024-11-08 11:41:38,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:41:38,202 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:41:38,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:41:38,203 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:41:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:41:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1909880835, now seen corresponding path program 1 times [2024-11-08 11:41:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:41:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952908604] [2024-11-08 11:41:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:41:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:41:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:41:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-08 11:41:39,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:41:39,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952908604] [2024-11-08 11:41:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952908604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:41:39,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:41:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:41:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560683696] [2024-11-08 11:41:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:41:39,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:41:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:41:39,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:41:39,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:39,941 INFO L87 Difference]: Start difference. First operand 63905 states and 67983 transitions. Second operand has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:41:42,201 INFO L93 Difference]: Finished difference Result 121401 states and 129098 transitions. [2024-11-08 11:41:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:41:42,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 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 980 [2024-11-08 11:41:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:41:42,204 INFO L225 Difference]: With dead ends: 121401 [2024-11-08 11:41:42,204 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:41:42,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:41:42,232 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 461 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:41:42,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 710 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 11:41:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:41:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:41:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:41:42,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 980 [2024-11-08 11:41:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:41:42,237 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:41:42,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:41:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:41:42,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:41:42,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:41:42,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:41:42,252 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:41:42,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:41:47,612 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 403 DAG size of output: 486 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-08 11:41:49,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:41:49,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:41:49 BoogieIcfgContainer [2024-11-08 11:41:49,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:41:49,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:41:49,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:41:49,535 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:41:49,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:44" (3/4) ... [2024-11-08 11:41:49,537 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:41:49,560 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 11:41:49,562 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:41:49,564 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:41:49,566 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:41:49,764 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:41:49,764 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:41:49,764 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:41:49,765 INFO L158 Benchmark]: Toolchain (without parser) took 69733.32ms. Allocated memory was 159.4MB in the beginning and 12.3GB in the end (delta: 12.1GB). Free memory was 92.8MB in the beginning and 10.0GB in the end (delta: -9.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-08 11:41:49,765 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:41:49,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1077.23ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 92.3MB in the beginning and 156.8MB in the end (delta: -64.5MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-11-08 11:41:49,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.83ms. Allocated memory is still 226.5MB. Free memory was 156.8MB in the beginning and 93.2MB in the end (delta: 63.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-08 11:41:49,768 INFO L158 Benchmark]: Boogie Preprocessor took 453.45ms. Allocated memory was 226.5MB in the beginning and 453.0MB in the end (delta: 226.5MB). Free memory was 93.2MB in the beginning and 341.8MB in the end (delta: -248.6MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2024-11-08 11:41:49,768 INFO L158 Benchmark]: RCFGBuilder took 2601.46ms. Allocated memory is still 453.0MB. Free memory was 341.8MB in the beginning and 238.5MB in the end (delta: 103.3MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. [2024-11-08 11:41:49,769 INFO L158 Benchmark]: TraceAbstraction took 65204.33ms. Allocated memory was 453.0MB in the beginning and 12.3GB in the end (delta: 11.8GB). Free memory was 237.5MB in the beginning and 10.0GB in the end (delta: -9.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-08 11:41:49,769 INFO L158 Benchmark]: Witness Printer took 229.49ms. Allocated memory is still 12.3GB. Free memory was 10.0GB in the beginning and 10.0GB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 11:41:49,770 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.18ms. Allocated memory is still 159.4MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1077.23ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 92.3MB in the beginning and 156.8MB in the end (delta: -64.5MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 160.83ms. Allocated memory is still 226.5MB. Free memory was 156.8MB in the beginning and 93.2MB in the end (delta: 63.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 453.45ms. Allocated memory was 226.5MB in the beginning and 453.0MB in the end (delta: 226.5MB). Free memory was 93.2MB in the beginning and 341.8MB in the end (delta: -248.6MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2601.46ms. Allocated memory is still 453.0MB. Free memory was 341.8MB in the beginning and 238.5MB in the end (delta: 103.3MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. * TraceAbstraction took 65204.33ms. Allocated memory was 453.0MB in the beginning and 12.3GB in the end (delta: 11.8GB). Free memory was 237.5MB in the beginning and 10.0GB in the end (delta: -9.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 229.49ms. Allocated memory is still 12.3GB. Free memory was 10.0GB in the beginning and 10.0GB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. 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: 207]: 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, 590 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.9s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 37.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10687 SdHoareTripleChecker+Valid, 32.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10687 mSDsluCounter, 10276 SdHoareTripleChecker+Invalid, 27.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 6343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31056 IncrementalHoareTripleChecker+Invalid, 37399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6343 mSolverCounterUnsat, 9060 mSDtfsCounter, 31056 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1156 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75076occurred in iteration=15, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 34606 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 9482 NumberOfCodeBlocks, 9482 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 10008 ConstructedInterpolants, 0 QuantifiedInterpolants, 25254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 9362/9646 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: 2590]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((a21 <= 124) && (a26 <= 222)) && (((long long) a14 + 114) <= 0)) && (0 <= ((long long) a14 + 600000))) || ((((a21 <= 124) && (a26 <= 217)) && (a24 <= 1)) && (0 <= ((long long) a14 + 83)))) || ((((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (((long long) a14 + 114) <= 0)) && (218 <= a26)) && (0 <= ((long long) a14 + 600000)))) || (((a21 <= 124) && (136 <= a28)) && (a26 <= 124))) || (((((a21 <= 124) && (((long long) a14 + 182) <= 0)) && (a26 <= 600237)) && (136 <= a28)) && (0 <= ((long long) a14 + 600000)))) || (((((a21 <= 124) && (a26 <= 222)) && (a24 == 2)) && (((long long) a14 + 84) <= 0)) && (0 <= ((long long) a14 + 113)))) || ((((a21 <= 124) && (a26 <= 124)) && (((long long) a14 + 84) <= 0)) && (0 <= ((long long) a14 + 113)))) || ((((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (a28 <= 134)) && (218 <= a26)) && (0 <= ((long long) a14 + 600000)))) || (((a21 <= 124) && (a28 <= 134)) && (((long long) a26 + 68) <= 0))) || ((((long long) a14 + 182) <= 0) && (a24 <= 1))) || (((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (a28 <= 134)) && (38 <= a28))) || ((((((a21 <= 124) && (a26 <= 217)) && (a24 == 2)) && (0 <= ((long long) a14 + 83))) && (125 <= a26)) && (38 <= a28))) || ((a24 <= 1) && (((long long) a26 + 68) <= 0))) || (((a21 <= 124) && (((long long) a26 + 68) <= 0)) && (0 <= ((long long) a14 + 600000)))) || ((((a21 <= 124) && (a26 <= 600237)) && (222 <= a26)) && (a24 <= 1))) || (((((a21 <= 124) && (a26 <= 600237)) && (136 <= a28)) && (a24 == 2)) && (218 <= a26))) || ((((a21 <= 124) && (244792 <= a14)) && (a26 <= 124)) && (a24 == 2))) || ((((a21 <= 124) && (a26 <= 222)) && (136 <= a28)) && (a24 == 2))) || (((((a21 <= 124) && (a24 <= 1)) && (218 <= a26)) || (((a21 <= 124) && (a24 <= 1)) && (38 <= a28))) && (((long long) a14 + 84) <= 0))) || ((((a21 <= 124) && (a26 <= 222)) && (a24 <= 1)) && (218 <= a26))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:41:49,799 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