./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/Problem16_label55.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 8e1a5ec7c69529be2d8c0f142d6c458fe9f526e0a4b1c8c2c339cb2c1b253dd3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:15:07,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:15:07,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:15:07,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:15:07,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:15:08,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:15:08,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:15:08,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:15:08,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:15:08,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:15:08,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:15:08,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:15:08,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:15:08,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:15:08,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:15:08,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:15:08,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:15:08,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:15:08,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:15:08,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:15:08,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:15:08,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:15:08,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:15:08,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:15:08,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:15:08,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:15:08,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:15:08,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:15:08,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:15:08,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:15:08,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:15:08,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:15:08,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:15:08,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:15:08,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:15:08,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:15:08,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:15:08,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:15:08,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:15:08,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:15:08,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:15:08,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:15:08,026 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 -> 8e1a5ec7c69529be2d8c0f142d6c458fe9f526e0a4b1c8c2c339cb2c1b253dd3 [2024-11-11 17:15:08,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:15:08,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:15:08,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:15:08,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:15:08,250 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:15:08,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label55.c [2024-11-11 17:15:09,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:15:09,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:15:09,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.c [2024-11-11 17:15:09,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1d26aca/28d75ebc0a394562a9895217f0a49f32/FLAG9d5329ca1 [2024-11-11 17:15:09,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1d26aca/28d75ebc0a394562a9895217f0a49f32 [2024-11-11 17:15:09,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:15:09,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:15:09,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:15:09,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:15:09,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:15:09,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:15:09" (1/1) ... [2024-11-11 17:15:09,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345de11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:09, skipping insertion in model container [2024-11-11 17:15:09,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:15:09" (1/1) ... [2024-11-11 17:15:09,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:15:10,145 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/Problem16_label55.c[5995,6008] [2024-11-11 17:15:10,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:15:10,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:15:10,402 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/Problem16_label55.c[5995,6008] [2024-11-11 17:15:10,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:15:10,665 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:15:10,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10 WrapperNode [2024-11-11 17:15:10,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:15:10,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:15:10,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:15:10,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:15:10,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,783 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-11 17:15:10,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:15:10,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:15:10,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:15:10,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:15:10,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,844 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-11 17:15:10,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:15:10,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:15:10,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:15:10,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:15:10,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (1/1) ... [2024-11-11 17:15:10,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:15:10,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:15:10,954 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-11 17:15:10,957 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-11 17:15:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:15:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:15:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:15:11,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:15:11,097 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:15:11,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:15:12,670 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-11 17:15:12,670 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:15:12,692 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:15:12,692 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:15:12,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:15:12 BoogieIcfgContainer [2024-11-11 17:15:12,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:15:12,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:15:12,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:15:12,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:15:12,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:15:09" (1/3) ... [2024-11-11 17:15:12,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5ccaae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:15:12, skipping insertion in model container [2024-11-11 17:15:12,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:15:10" (2/3) ... [2024-11-11 17:15:12,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5ccaae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:15:12, skipping insertion in model container [2024-11-11 17:15:12,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:15:12" (3/3) ... [2024-11-11 17:15:12,699 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label55.c [2024-11-11 17:15:12,713 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:15:12,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:15:12,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:15:12,795 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;@20aecb93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:15:12,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:15:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 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-11 17:15:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 17:15:12,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:12,807 INFO L218 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] [2024-11-11 17:15:12,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2024-11-11 17:15:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694048607] [2024-11-11 17:15:12,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:13,119 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-11 17:15:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694048607] [2024-11-11 17:15:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694048607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:13,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:15:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489587246] [2024-11-11 17:15:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:13,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:13,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:13,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:13,171 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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-11 17:15:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:14,743 INFO L93 Difference]: Finished difference Result 1122 states and 2103 transitions. [2024-11-11 17:15:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:14,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-11 17:15:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:14,761 INFO L225 Difference]: With dead ends: 1122 [2024-11-11 17:15:14,762 INFO L226 Difference]: Without dead ends: 662 [2024-11-11 17:15:14,765 INFO L434 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-11 17:15:14,768 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 330 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:14,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 17:15:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-11 17:15:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-11 17:15:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 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-11 17:15:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2024-11-11 17:15:14,829 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 57 [2024-11-11 17:15:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:14,830 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2024-11-11 17:15:14,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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-11 17:15:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2024-11-11 17:15:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 17:15:14,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:14,834 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:15:14,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:15:14,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:14,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 234836894, now seen corresponding path program 1 times [2024-11-11 17:15:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968410016] [2024-11-11 17:15:14,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:15:15,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:15,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968410016] [2024-11-11 17:15:15,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968410016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:15,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:15,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:15:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265651891] [2024-11-11 17:15:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:15,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:15,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:15,072 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:15:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:16,401 INFO L93 Difference]: Finished difference Result 1980 states and 3007 transitions. [2024-11-11 17:15:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:16,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-11 17:15:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:16,405 INFO L225 Difference]: With dead ends: 1980 [2024-11-11 17:15:16,406 INFO L226 Difference]: Without dead ends: 1320 [2024-11-11 17:15:16,407 INFO L434 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-11 17:15:16,408 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:16,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 216 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:15:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-11 17:15:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2024-11-11 17:15:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4564063684609552) internal successors, (1921), 1319 states have internal predecessors, (1921), 0 states have call successors, (0), 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-11 17:15:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1921 transitions. [2024-11-11 17:15:16,441 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1921 transitions. Word has length 125 [2024-11-11 17:15:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1921 transitions. [2024-11-11 17:15:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:15:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1921 transitions. [2024-11-11 17:15:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 17:15:16,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:16,445 INFO L218 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, 1, 1, 1, 1, 1, 1, 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-11 17:15:16,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:15:16,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 300737271, now seen corresponding path program 1 times [2024-11-11 17:15:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45958477] [2024-11-11 17:15:16,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:15:16,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:16,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45958477] [2024-11-11 17:15:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45958477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:16,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:16,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:15:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885304509] [2024-11-11 17:15:16,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:16,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:16,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:16,570 INFO L87 Difference]: Start difference. First operand 1320 states and 1921 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-11 17:15:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:17,689 INFO L93 Difference]: Finished difference Result 3954 states and 5758 transitions. [2024-11-11 17:15:17,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-11 17:15:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:17,697 INFO L225 Difference]: With dead ends: 3954 [2024-11-11 17:15:17,697 INFO L226 Difference]: Without dead ends: 2636 [2024-11-11 17:15:17,698 INFO L434 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-11 17:15:17,699 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:17,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:15:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2024-11-11 17:15:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2024-11-11 17:15:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3248576850094878) internal successors, (3491), 2635 states have internal predecessors, (3491), 0 states have call successors, (0), 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-11 17:15:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3491 transitions. [2024-11-11 17:15:17,735 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3491 transitions. Word has length 136 [2024-11-11 17:15:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:17,735 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3491 transitions. [2024-11-11 17:15:17,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-11 17:15:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3491 transitions. [2024-11-11 17:15:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-11 17:15:17,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:17,738 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:15:17,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:15:17,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:17,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1026789817, now seen corresponding path program 1 times [2024-11-11 17:15:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:17,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145465349] [2024-11-11 17:15:17,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:15:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145465349] [2024-11-11 17:15:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145465349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:17,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:17,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:15:17,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602261568] [2024-11-11 17:15:17,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:17,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:17,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:17,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:17,876 INFO L87 Difference]: Start difference. First operand 2636 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:15:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:18,892 INFO L93 Difference]: Finished difference Result 6586 states and 8550 transitions. [2024-11-11 17:15:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2024-11-11 17:15:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:18,904 INFO L225 Difference]: With dead ends: 6586 [2024-11-11 17:15:18,904 INFO L226 Difference]: Without dead ends: 3952 [2024-11-11 17:15:18,907 INFO L434 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-11 17:15:18,908 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:18,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 83 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 17:15:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-11 17:15:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-11 17:15:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.2171602126044039) internal successors, (4809), 3951 states have internal predecessors, (4809), 0 states have call successors, (0), 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-11 17:15:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4809 transitions. [2024-11-11 17:15:18,953 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4809 transitions. Word has length 188 [2024-11-11 17:15:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:18,953 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4809 transitions. [2024-11-11 17:15:18,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:15:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4809 transitions. [2024-11-11 17:15:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-11 17:15:18,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:18,956 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:15:18,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:15:18,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:18,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1964801853, now seen corresponding path program 1 times [2024-11-11 17:15:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:18,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488418714] [2024-11-11 17:15:18,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:15:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:19,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488418714] [2024-11-11 17:15:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488418714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:19,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833686908] [2024-11-11 17:15:19,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:19,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:19,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:19,205 INFO L87 Difference]: Start difference. First operand 3952 states and 4809 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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-11 17:15:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:20,263 INFO L93 Difference]: Finished difference Result 9547 states and 11836 transitions. [2024-11-11 17:15:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 292 [2024-11-11 17:15:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:20,278 INFO L225 Difference]: With dead ends: 9547 [2024-11-11 17:15:20,279 INFO L226 Difference]: Without dead ends: 5597 [2024-11-11 17:15:20,284 INFO L434 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-11 17:15:20,285 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 285 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:20,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 247 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 17:15:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2024-11-11 17:15:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2024-11-11 17:15:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2101501072194425) internal successors, (6772), 5596 states have internal predecessors, (6772), 0 states have call successors, (0), 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-11 17:15:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6772 transitions. [2024-11-11 17:15:20,354 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6772 transitions. Word has length 292 [2024-11-11 17:15:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6772 transitions. [2024-11-11 17:15:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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-11 17:15:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6772 transitions. [2024-11-11 17:15:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-11 17:15:20,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:20,357 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:15:20,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:15:20,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:20,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 291298166, now seen corresponding path program 1 times [2024-11-11 17:15:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:20,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865882220] [2024-11-11 17:15:20,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:15:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865882220] [2024-11-11 17:15:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865882220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997536702] [2024-11-11 17:15:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:20,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:15:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:20,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:15:20,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:15:20,806 INFO L87 Difference]: Start difference. First operand 5597 states and 6772 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-11 17:15:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:22,379 INFO L93 Difference]: Finished difference Result 11521 states and 13883 transitions. [2024-11-11 17:15:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:15:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 302 [2024-11-11 17:15:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:22,409 INFO L225 Difference]: With dead ends: 11521 [2024-11-11 17:15:22,413 INFO L226 Difference]: Without dead ends: 5926 [2024-11-11 17:15:22,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:15:22,423 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:22,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 322 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 17:15:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2024-11-11 17:15:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2024-11-11 17:15:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5926 states, 5925 states have (on average 1.199493670886076) internal successors, (7107), 5925 states have internal predecessors, (7107), 0 states have call successors, (0), 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-11 17:15:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 7107 transitions. [2024-11-11 17:15:22,537 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 7107 transitions. Word has length 302 [2024-11-11 17:15:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:22,538 INFO L471 AbstractCegarLoop]: Abstraction has 5926 states and 7107 transitions. [2024-11-11 17:15:22,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-11 17:15:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 7107 transitions. [2024-11-11 17:15:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-11 17:15:22,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:22,542 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:15:22,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:15:22,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:22,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1616783716, now seen corresponding path program 1 times [2024-11-11 17:15:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135543025] [2024-11-11 17:15:22,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:15:22,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135543025] [2024-11-11 17:15:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135543025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 17:15:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986043867] [2024-11-11 17:15:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:22,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 17:15:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:23,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 17:15:23,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:15:23,000 INFO L87 Difference]: Start difference. First operand 5926 states and 7107 transitions. Second operand has 7 states, 7 states have (on average 55.57142857142857) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:15:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:24,447 INFO L93 Difference]: Finished difference Result 11380 states and 13724 transitions. [2024-11-11 17:15:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 17:15:24,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.57142857142857) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 389 [2024-11-11 17:15:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:24,460 INFO L225 Difference]: With dead ends: 11380 [2024-11-11 17:15:24,461 INFO L226 Difference]: Without dead ends: 5597 [2024-11-11 17:15:24,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:15:24,468 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 308 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:24,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 291 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:15:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2024-11-11 17:15:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2024-11-11 17:15:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0816654753395283) internal successors, (6053), 5596 states have internal predecessors, (6053), 0 states have call successors, (0), 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-11 17:15:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6053 transitions. [2024-11-11 17:15:24,528 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6053 transitions. Word has length 389 [2024-11-11 17:15:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:24,529 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6053 transitions. [2024-11-11 17:15:24,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.57142857142857) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:15:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6053 transitions. [2024-11-11 17:15:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-11-11 17:15:24,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:24,533 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:15:24,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:15:24,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash -457503876, now seen corresponding path program 1 times [2024-11-11 17:15:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658303136] [2024-11-11 17:15:24,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-11 17:15:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:24,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658303136] [2024-11-11 17:15:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658303136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:24,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958449342] [2024-11-11 17:15:24,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:24,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:24,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:24,815 INFO L87 Difference]: Start difference. First operand 5597 states and 6053 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-11 17:15:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:25,601 INFO L93 Difference]: Finished difference Result 12837 states and 13987 transitions. [2024-11-11 17:15:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:25,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 396 [2024-11-11 17:15:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:25,617 INFO L225 Difference]: With dead ends: 12837 [2024-11-11 17:15:25,617 INFO L226 Difference]: Without dead ends: 7571 [2024-11-11 17:15:25,622 INFO L434 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-11 17:15:25,623 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 292 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:25,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 40 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:15:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2024-11-11 17:15:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7242. [2024-11-11 17:15:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 7241 states have (on average 1.0860378400773374) internal successors, (7864), 7241 states have internal predecessors, (7864), 0 states have call successors, (0), 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-11 17:15:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7864 transitions. [2024-11-11 17:15:25,696 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7864 transitions. Word has length 396 [2024-11-11 17:15:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:25,696 INFO L471 AbstractCegarLoop]: Abstraction has 7242 states and 7864 transitions. [2024-11-11 17:15:25,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-11 17:15:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7864 transitions. [2024-11-11 17:15:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-11-11 17:15:25,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:25,701 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:15:25,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:15:25,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1737546115, now seen corresponding path program 1 times [2024-11-11 17:15:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510820718] [2024-11-11 17:15:25,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-11 17:15:26,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:26,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510820718] [2024-11-11 17:15:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510820718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:15:26,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939499651] [2024-11-11 17:15:26,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:26,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:15:26,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:15:26,078 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-11 17:15:26,079 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-11 17:15:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:26,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:15:26,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:15:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-11-11 17:15:26,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:15:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939499651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:26,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:15:26,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-11 17:15:26,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495150456] [2024-11-11 17:15:26,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:26,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:15:26,665 INFO L87 Difference]: Start difference. First operand 7242 states and 7864 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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-11 17:15:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:27,346 INFO L93 Difference]: Finished difference Result 9218 states and 9900 transitions. [2024-11-11 17:15:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:27,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 450 [2024-11-11 17:15:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:27,357 INFO L225 Difference]: With dead ends: 9218 [2024-11-11 17:15:27,358 INFO L226 Difference]: Without dead ends: 9216 [2024-11-11 17:15:27,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:15:27,360 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:27,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:15:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2024-11-11 17:15:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7900. [2024-11-11 17:15:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0817825041144449) internal successors, (8545), 7899 states have internal predecessors, (8545), 0 states have call successors, (0), 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-11 17:15:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8545 transitions. [2024-11-11 17:15:27,432 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8545 transitions. Word has length 450 [2024-11-11 17:15:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:27,432 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8545 transitions. [2024-11-11 17:15:27,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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-11 17:15:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8545 transitions. [2024-11-11 17:15:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-11 17:15:27,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:27,451 INFO L218 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:15:27,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 17:15:27,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:15:27,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:27,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 508740985, now seen corresponding path program 1 times [2024-11-11 17:15:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936134024] [2024-11-11 17:15:27,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-11-11 17:15:28,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936134024] [2024-11-11 17:15:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936134024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:28,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:28,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851069664] [2024-11-11 17:15:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:28,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:15:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:15:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:15:28,524 INFO L87 Difference]: Start difference. First operand 7900 states and 8545 transitions. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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-11 17:15:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:29,695 INFO L93 Difference]: Finished difference Result 19088 states and 20669 transitions. [2024-11-11 17:15:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:15:29,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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 851 [2024-11-11 17:15:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:29,712 INFO L225 Difference]: With dead ends: 19088 [2024-11-11 17:15:29,712 INFO L226 Difference]: Without dead ends: 11519 [2024-11-11 17:15:29,720 INFO L434 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-11 17:15:29,721 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 270 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:29,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 91 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:15:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2024-11-11 17:15:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11190. [2024-11-11 17:15:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.07802305836089) internal successors, (12062), 11189 states have internal predecessors, (12062), 0 states have call successors, (0), 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-11 17:15:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 12062 transitions. [2024-11-11 17:15:29,866 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 12062 transitions. Word has length 851 [2024-11-11 17:15:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:29,867 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 12062 transitions. [2024-11-11 17:15:29,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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-11 17:15:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 12062 transitions. [2024-11-11 17:15:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 890 [2024-11-11 17:15:29,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:29,885 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:15:29,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:15:29,885 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:29,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 585018567, now seen corresponding path program 1 times [2024-11-11 17:15:29,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:29,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108055780] [2024-11-11 17:15:29,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1902 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-11 17:15:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:30,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108055780] [2024-11-11 17:15:30,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108055780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:30,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:30,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:30,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034783768] [2024-11-11 17:15:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:30,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:15:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:15:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:15:30,728 INFO L87 Difference]: Start difference. First operand 11190 states and 12062 transitions. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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-11 17:15:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:31,595 INFO L93 Difference]: Finished difference Result 21720 states and 23455 transitions. [2024-11-11 17:15:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:31,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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 889 [2024-11-11 17:15:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:31,624 INFO L225 Difference]: With dead ends: 21720 [2024-11-11 17:15:31,624 INFO L226 Difference]: Without dead ends: 11190 [2024-11-11 17:15:31,644 INFO L434 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-11 17:15:31,645 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:31,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 113 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:15:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2024-11-11 17:15:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190. [2024-11-11 17:15:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.0777549378854232) internal successors, (12059), 11189 states have internal predecessors, (12059), 0 states have call successors, (0), 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-11 17:15:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 12059 transitions. [2024-11-11 17:15:31,846 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 12059 transitions. Word has length 889 [2024-11-11 17:15:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:31,847 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 12059 transitions. [2024-11-11 17:15:31,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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-11 17:15:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 12059 transitions. [2024-11-11 17:15:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2024-11-11 17:15:31,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:31,858 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 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-11 17:15:31,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:15:31,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:31,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:31,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1374879225, now seen corresponding path program 1 times [2024-11-11 17:15:31,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:31,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907751555] [2024-11-11 17:15:31,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:31,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 1247 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-11 17:15:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907751555] [2024-11-11 17:15:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907751555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:32,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:32,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132703191] [2024-11-11 17:15:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:32,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:32,318 INFO L87 Difference]: Start difference. First operand 11190 states and 12059 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-11 17:15:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:33,116 INFO L93 Difference]: Finished difference Result 24352 states and 26403 transitions. [2024-11-11 17:15:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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 950 [2024-11-11 17:15:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:33,144 INFO L225 Difference]: With dead ends: 24352 [2024-11-11 17:15:33,144 INFO L226 Difference]: Without dead ends: 13822 [2024-11-11 17:15:33,160 INFO L434 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-11 17:15:33,165 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:33,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 437 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:15:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2024-11-11 17:15:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2024-11-11 17:15:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0672339132416622) internal successors, (14048), 13163 states have internal predecessors, (14048), 0 states have call successors, (0), 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-11 17:15:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 14048 transitions. [2024-11-11 17:15:33,277 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 14048 transitions. Word has length 950 [2024-11-11 17:15:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:33,277 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 14048 transitions. [2024-11-11 17:15:33,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-11 17:15:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 14048 transitions. [2024-11-11 17:15:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2024-11-11 17:15:33,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:33,292 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:15:33,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:15:33,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1483424277, now seen corresponding path program 1 times [2024-11-11 17:15:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:33,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99519122] [2024-11-11 17:15:33,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2515 backedges. 1398 proven. 0 refuted. 0 times theorem prover too weak. 1117 trivial. 0 not checked. [2024-11-11 17:15:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99519122] [2024-11-11 17:15:33,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99519122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:33,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:33,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:33,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905989866] [2024-11-11 17:15:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:33,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:33,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:33,863 INFO L87 Difference]: Start difference. First operand 13164 states and 14048 transitions. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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-11 17:15:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:34,695 INFO L93 Difference]: Finished difference Result 30603 states and 32764 transitions. [2024-11-11 17:15:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 1064 [2024-11-11 17:15:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:34,712 INFO L225 Difference]: With dead ends: 30603 [2024-11-11 17:15:34,713 INFO L226 Difference]: Without dead ends: 16125 [2024-11-11 17:15:34,725 INFO L434 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-11 17:15:34,726 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:34,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:15:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2024-11-11 17:15:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2024-11-11 17:15:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0517861572810716) internal successors, (16959), 16124 states have internal predecessors, (16959), 0 states have call successors, (0), 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-11 17:15:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16959 transitions. [2024-11-11 17:15:34,924 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16959 transitions. Word has length 1064 [2024-11-11 17:15:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16959 transitions. [2024-11-11 17:15:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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-11 17:15:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16959 transitions. [2024-11-11 17:15:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2024-11-11 17:15:34,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:15:34,949 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-11 17:15:34,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 17:15:34,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:15:34,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:15:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash 861443405, now seen corresponding path program 1 times [2024-11-11 17:15:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:15:34,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689306804] [2024-11-11 17:15:34,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:15:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:15:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:15:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2353 proven. 0 refuted. 0 times theorem prover too weak. 1872 trivial. 0 not checked. [2024-11-11 17:15:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:15:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689306804] [2024-11-11 17:15:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689306804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:15:35,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:15:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:15:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103098932] [2024-11-11 17:15:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:15:35,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:15:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:15:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:15:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:15:35,818 INFO L87 Difference]: Start difference. First operand 16125 states and 16959 transitions. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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-11 17:15:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:15:36,590 INFO L93 Difference]: Finished difference Result 35207 states and 37093 transitions. [2024-11-11 17:15:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:15:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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 1542 [2024-11-11 17:15:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:15:36,592 INFO L225 Difference]: With dead ends: 35207 [2024-11-11 17:15:36,592 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:15:36,604 INFO L434 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-11 17:15:36,604 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:15:36,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 409 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:15:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:15:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:15:36,605 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-11 17:15:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:15:36,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1542 [2024-11-11 17:15:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:15:36,606 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:15:36,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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-11 17:15:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:15:36,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:15:36,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:15:36,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 17:15:36,611 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:15:36,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:15:37,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:15:37,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:15:37 BoogieIcfgContainer [2024-11-11 17:15:37,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:15:37,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:15:37,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:15:37,073 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:15:37,073 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:15:12" (3/4) ... [2024-11-11 17:15:37,075 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:15:37,094 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-11 17:15:37,095 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:15:37,097 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:15:37,098 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:15:37,349 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:15:37,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:15:37,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:15:37,350 INFO L158 Benchmark]: Toolchain (without parser) took 27427.61ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 937.4MB). Free memory was 125.4MB in the beginning and 988.7MB in the end (delta: -863.3MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-11-11 17:15:37,351 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:15:37,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.24ms. Allocated memory is still 201.3MB. Free memory was 125.1MB in the beginning and 144.9MB in the end (delta: -19.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-11 17:15:37,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.52ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 120.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 17:15:37,351 INFO L158 Benchmark]: Boogie Preprocessor took 134.33ms. Allocated memory is still 201.3MB. Free memory was 120.9MB in the beginning and 87.1MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-11 17:15:37,352 INFO L158 Benchmark]: RCFGBuilder took 1772.67ms. Allocated memory was 201.3MB in the beginning and 385.9MB in the end (delta: 184.5MB). Free memory was 86.1MB in the beginning and 259.2MB in the end (delta: -173.0MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-11-11 17:15:37,352 INFO L158 Benchmark]: TraceAbstraction took 24377.73ms. Allocated memory was 385.9MB in the beginning and 1.1GB in the end (delta: 752.9MB). Free memory was 258.1MB in the beginning and 1.0GB in the end (delta: -756.8MB). Peak memory consumption was 609.5MB. Max. memory is 16.1GB. [2024-11-11 17:15:37,352 INFO L158 Benchmark]: Witness Printer took 277.57ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 988.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 17:15:37,353 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.24ms. Allocated memory is still 201.3MB. Free memory was 125.1MB in the beginning and 144.9MB in the end (delta: -19.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.52ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 120.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.33ms. Allocated memory is still 201.3MB. Free memory was 120.9MB in the beginning and 87.1MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1772.67ms. Allocated memory was 201.3MB in the beginning and 385.9MB in the end (delta: 184.5MB). Free memory was 86.1MB in the beginning and 259.2MB in the end (delta: -173.0MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24377.73ms. Allocated memory was 385.9MB in the beginning and 1.1GB in the end (delta: 752.9MB). Free memory was 258.1MB in the beginning and 1.0GB in the end (delta: -756.8MB). Peak memory consumption was 609.5MB. Max. memory is 16.1GB. * Witness Printer took 277.57ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 988.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 188]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 14, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3445 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3445 mSDsluCounter, 3171 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 2604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13532 IncrementalHoareTripleChecker+Invalid, 16136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2604 mSolverCounterUnsat, 3022 mSDtfsCounter, 13532 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16125occurred in iteration=13, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 2632 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 8081 NumberOfCodeBlocks, 8081 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 8066 ConstructedInterpolants, 0 QuantifiedInterpolants, 22691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 13066/13180 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: 1783]: Loop Invariant Derived loop invariant: (((((((a16 == 8) || ((a15 <= 3) && (11 <= a16))) || (a16 == 9)) || ((a15 <= 3) && (a12 <= 7))) || ((0 <= ((long long) 87 + a18)) && (a15 <= 3))) || ((a15 <= 3) && (a12 == 8))) || ((a12 <= 6) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:15:37,409 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