./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label34.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_label34.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 b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:13:28,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:13:28,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:13:28,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:13:28,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:13:28,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:13:28,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:13:28,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:13:28,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:13:28,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:13:28,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:13:28,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:13:28,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:13:28,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:13:28,929 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:13:28,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:13:28,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:13:28,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:13:28,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:13:28,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:13:28,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:13:28,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:13:28,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:13:28,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:13:28,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:13:28,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:13:28,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:13:28,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:13:28,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:13:28,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:13:28,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:13:28,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:13:28,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:13:28,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:13:28,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:13:28,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:13:28,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:13:28,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:13:28,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:13:28,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:13:28,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:13:28,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:13:28,940 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 -> b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1 [2024-11-11 17:13:29,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:13:29,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:13:29,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:13:29,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:13:29,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:13:29,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2024-11-11 17:13:30,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:13:30,981 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:13:30,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2024-11-11 17:13:31,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dba7d15/d73697beb77e46c3943fe3941a40ae78/FLAGb14305421 [2024-11-11 17:13:31,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dba7d15/d73697beb77e46c3943fe3941a40ae78 [2024-11-11 17:13:31,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:13:31,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:13:31,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:13:31,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:13:31,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:13:31,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:31,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b07fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31, skipping insertion in model container [2024-11-11 17:13:31,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:31,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:13:31,404 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_label34.c[3712,3725] [2024-11-11 17:13:31,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:13:31,746 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:13:31,766 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_label34.c[3712,3725] [2024-11-11 17:13:31,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:13:31,985 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:13:31,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31 WrapperNode [2024-11-11 17:13:31,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:13:31,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:13:31,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:13:31,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:13:31,995 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:13:31" (1/1) ... [2024-11-11 17:13:32,033 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:13:31" (1/1) ... [2024-11-11 17:13:32,159 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-11 17:13:32,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:13:32,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:13:32,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:13:32,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:13:32,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,306 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:13:32,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:13:32,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:13:32,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:13:32,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:13:32,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (1/1) ... [2024-11-11 17:13:32,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:13:32,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:13:32,440 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:13:32,443 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:13:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:13:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:13:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:13:32,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:13:32,555 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:13:32,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:13:34,445 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-11 17:13:34,446 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:13:34,473 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:13:34,477 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:13:34,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:13:34 BoogieIcfgContainer [2024-11-11 17:13:34,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:13:34,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:13:34,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:13:34,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:13:34,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:13:31" (1/3) ... [2024-11-11 17:13:34,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3312d59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:13:34, skipping insertion in model container [2024-11-11 17:13:34,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:13:31" (2/3) ... [2024-11-11 17:13:34,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3312d59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:13:34, skipping insertion in model container [2024-11-11 17:13:34,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:13:34" (3/3) ... [2024-11-11 17:13:34,488 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label34.c [2024-11-11 17:13:34,504 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:13:34,504 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:13:34,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:13:34,593 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;@2af5c03e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:13:34,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:13:34,599 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:13:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 17:13:34,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:34,608 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] [2024-11-11 17:13:34,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:34,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2024-11-11 17:13:34,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:34,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912876260] [2024-11-11 17:13:34,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:34,914 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:13:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:34,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912876260] [2024-11-11 17:13:34,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912876260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:34,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:34,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:13:34,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402309749] [2024-11-11 17:13:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:34,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:34,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:34,954 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 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:13:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:36,805 INFO L93 Difference]: Finished difference Result 1137 states and 2118 transitions. [2024-11-11 17:13:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:36,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-11 17:13:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:36,833 INFO L225 Difference]: With dead ends: 1137 [2024-11-11 17:13:36,834 INFO L226 Difference]: Without dead ends: 662 [2024-11-11 17:13:36,839 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:13:36,844 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 350 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:36,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 17:13:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-11 17:13:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-11 17:13:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:13:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2024-11-11 17:13:36,926 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 34 [2024-11-11 17:13:36,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:36,926 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2024-11-11 17:13:36,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:13:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2024-11-11 17:13:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 17:13:36,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:36,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:13:36,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1425472999, now seen corresponding path program 1 times [2024-11-11 17:13:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817154214] [2024-11-11 17:13:36,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:13:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817154214] [2024-11-11 17:13:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817154214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:37,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:37,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:13:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193724329] [2024-11-11 17:13:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:37,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:37,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:37,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:37,169 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:13:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:38,442 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2024-11-11 17:13:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-11 17:13:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:38,448 INFO L225 Difference]: With dead ends: 1980 [2024-11-11 17:13:38,448 INFO L226 Difference]: Without dead ends: 1320 [2024-11-11 17:13:38,451 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:13:38,452 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:38,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:13:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-11 17:13:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2024-11-11 17:13:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.620166793025019) internal successors, (2137), 1319 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states 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:13:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2137 transitions. [2024-11-11 17:13:38,512 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2137 transitions. Word has length 100 [2024-11-11 17:13:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:38,513 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2137 transitions. [2024-11-11 17:13:38,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:13:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2137 transitions. [2024-11-11 17:13:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 17:13:38,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:38,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:38,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:13:38,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:38,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2065691269, now seen corresponding path program 1 times [2024-11-11 17:13:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:38,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409592445] [2024-11-11 17:13:38,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:13:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409592445] [2024-11-11 17:13:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409592445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:13:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425431105] [2024-11-11 17:13:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:38,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:38,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:38,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:38,696 INFO L87 Difference]: Start difference. First operand 1320 states and 2137 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:13:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:39,817 INFO L93 Difference]: Finished difference Result 3296 states and 5285 transitions. [2024-11-11 17:13:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:39,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-11 17:13:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:39,825 INFO L225 Difference]: With dead ends: 3296 [2024-11-11 17:13:39,825 INFO L226 Difference]: Without dead ends: 1978 [2024-11-11 17:13:39,827 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:13:39,828 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:39,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:13:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-11 17:13:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2024-11-11 17:13:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.3323216995447649) internal successors, (2634), 1977 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states 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:13:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2634 transitions. [2024-11-11 17:13:39,866 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2634 transitions. Word has length 101 [2024-11-11 17:13:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:39,866 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2634 transitions. [2024-11-11 17:13:39,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:13:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2634 transitions. [2024-11-11 17:13:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-11 17:13:39,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:39,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:39,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:13:39,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:39,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash 327435541, now seen corresponding path program 1 times [2024-11-11 17:13:39,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:39,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273593215] [2024-11-11 17:13:39,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:13:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273593215] [2024-11-11 17:13:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273593215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:13:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395435406] [2024-11-11 17:13:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:40,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:40,227 INFO L87 Difference]: Start difference. First operand 1978 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:13:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:41,563 INFO L93 Difference]: Finished difference Result 5928 states and 7897 transitions. [2024-11-11 17:13:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:41,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2024-11-11 17:13:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:41,576 INFO L225 Difference]: With dead ends: 5928 [2024-11-11 17:13:41,576 INFO L226 Difference]: Without dead ends: 3952 [2024-11-11 17:13:41,579 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:13:41,580 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:41,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 259 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:13:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-11 17:13:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-11 17:13:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.216400911161731) internal successors, (4806), 3951 states have internal predecessors, (4806), 0 states have call successors, (0), 0 states 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:13:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4806 transitions. [2024-11-11 17:13:41,646 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4806 transitions. Word has length 193 [2024-11-11 17:13:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:41,647 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4806 transitions. [2024-11-11 17:13:41,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:13:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4806 transitions. [2024-11-11 17:13:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-11 17:13:41,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:41,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:41,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:13:41,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:41,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash -791049858, now seen corresponding path program 1 times [2024-11-11 17:13:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:41,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176289598] [2024-11-11 17:13:41,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:13:42,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:42,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176289598] [2024-11-11 17:13:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176289598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396572438] [2024-11-11 17:13:42,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:42,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:13:42,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:42,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:13:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:13:42,406 INFO L87 Difference]: Start difference. First operand 3952 states and 4806 transitions. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:13:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:43,720 INFO L93 Difference]: Finished difference Result 8231 states and 9951 transitions. [2024-11-11 17:13:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:13:43,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2024-11-11 17:13:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:43,733 INFO L225 Difference]: With dead ends: 8231 [2024-11-11 17:13:43,733 INFO L226 Difference]: Without dead ends: 4281 [2024-11-11 17:13:43,739 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:13:43,740 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:43,740 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.2s Time] [2024-11-11 17:13:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-11-11 17:13:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2024-11-11 17:13:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2011682242990653) internal successors, (5141), 4280 states have internal predecessors, (5141), 0 states have call successors, (0), 0 states 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:13:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5141 transitions. [2024-11-11 17:13:43,844 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5141 transitions. Word has length 279 [2024-11-11 17:13:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:43,845 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5141 transitions. [2024-11-11 17:13:43,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:13:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5141 transitions. [2024-11-11 17:13:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-11-11 17:13:43,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:43,851 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:13:43,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:13:43,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:43,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash -250975345, now seen corresponding path program 1 times [2024-11-11 17:13:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639533990] [2024-11-11 17:13:43,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:13:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639533990] [2024-11-11 17:13:44,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639533990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:44,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 17:13:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507782727] [2024-11-11 17:13:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:44,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 17:13:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 17:13:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:13:44,526 INFO L87 Difference]: Start difference. First operand 4281 states and 5141 transitions. Second operand has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:13:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:46,203 INFO L93 Difference]: Finished difference Result 8090 states and 9792 transitions. [2024-11-11 17:13:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 17:13:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 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 366 [2024-11-11 17:13:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:46,219 INFO L225 Difference]: With dead ends: 8090 [2024-11-11 17:13:46,220 INFO L226 Difference]: Without dead ends: 3952 [2024-11-11 17:13:46,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:13:46,226 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 288 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:46,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 302 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 17:13:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-11 17:13:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-11 17:13:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0802328524424196) internal successors, (4268), 3951 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states 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:13:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4268 transitions. [2024-11-11 17:13:46,313 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4268 transitions. Word has length 366 [2024-11-11 17:13:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:46,313 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4268 transitions. [2024-11-11 17:13:46,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:13:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4268 transitions. [2024-11-11 17:13:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-11 17:13:46,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:46,318 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:13:46,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:13:46,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:46,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 873477943, now seen corresponding path program 1 times [2024-11-11 17:13:46,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:46,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274970749] [2024-11-11 17:13:46,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-11 17:13:46,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274970749] [2024-11-11 17:13:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274970749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:13:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41309890] [2024-11-11 17:13:46,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:46,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:13:46,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:13:46,905 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:13:46,906 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:13:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:47,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:13:47,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:13:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-11 17:13:47,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:13:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41309890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:47,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:13:47,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-11 17:13:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012909224] [2024-11-11 17:13:47,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:47,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:47,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:47,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:47,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:13:47,206 INFO L87 Difference]: Start difference. First operand 3952 states and 4268 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:13:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:48,154 INFO L93 Difference]: Finished difference Result 9547 states and 10414 transitions. [2024-11-11 17:13:48,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:48,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 373 [2024-11-11 17:13:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:48,167 INFO L225 Difference]: With dead ends: 9547 [2024-11-11 17:13:48,167 INFO L226 Difference]: Without dead ends: 5926 [2024-11-11 17:13:48,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 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:13:48,172 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 315 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 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.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:48,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 40 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 17:13:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2024-11-11 17:13:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2024-11-11 17:13:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5926 states, 5925 states have (on average 1.0828691983122363) internal successors, (6416), 5925 states have internal predecessors, (6416), 0 states have call successors, (0), 0 states 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:13:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6416 transitions. [2024-11-11 17:13:48,259 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6416 transitions. Word has length 373 [2024-11-11 17:13:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 5926 states and 6416 transitions. [2024-11-11 17:13:48,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:13:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6416 transitions. [2024-11-11 17:13:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-11 17:13:48,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:48,267 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:13:48,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 17:13:48,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:13:48,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:48,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash -705649539, now seen corresponding path program 1 times [2024-11-11 17:13:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:48,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438563026] [2024-11-11 17:13:48,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-11 17:13:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:49,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438563026] [2024-11-11 17:13:49,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438563026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:13:49,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770750208] [2024-11-11 17:13:49,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:49,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:13:49,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:13:49,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:13:49,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 17:13:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:49,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:13:49,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:13:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-11 17:13:49,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:13:49,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770750208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:49,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:13:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-11 17:13:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260644973] [2024-11-11 17:13:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:49,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:49,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:13:49,858 INFO L87 Difference]: Start difference. First operand 5926 states and 6416 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:13:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:50,511 INFO L93 Difference]: Finished difference Result 7573 states and 8112 transitions. [2024-11-11 17:13:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:50,512 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 490 [2024-11-11 17:13:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:50,529 INFO L225 Difference]: With dead ends: 7573 [2024-11-11 17:13:50,529 INFO L226 Difference]: Without dead ends: 7571 [2024-11-11 17:13:50,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 489 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:13:50,531 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:13:50,531 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:13:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2024-11-11 17:13:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 6255. [2024-11-11 17:13:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0805884234090182) internal successors, (6758), 6254 states have internal predecessors, (6758), 0 states have call successors, (0), 0 states 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:13:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6758 transitions. [2024-11-11 17:13:50,613 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6758 transitions. Word has length 490 [2024-11-11 17:13:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:50,614 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6758 transitions. [2024-11-11 17:13:50,614 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:13:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6758 transitions. [2024-11-11 17:13:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2024-11-11 17:13:50,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:50,643 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:13:50,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 17:13:50,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-11 17:13:50,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:50,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash -959414867, now seen corresponding path program 1 times [2024-11-11 17:13:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472823965] [2024-11-11 17:13:50,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-11 17:13:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472823965] [2024-11-11 17:13:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472823965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:52,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:52,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:13:52,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892033189] [2024-11-11 17:13:52,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:52,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:52,106 INFO L87 Difference]: Start difference. First operand 6255 states and 6758 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 2 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:13:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:52,849 INFO L93 Difference]: Finished difference Result 12508 states and 13520 transitions. [2024-11-11 17:13:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:52,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 2 states have internal predecessors, (446), 0 states have call successors, (0), 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 884 [2024-11-11 17:13:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:52,863 INFO L225 Difference]: With dead ends: 12508 [2024-11-11 17:13:52,864 INFO L226 Difference]: Without dead ends: 6584 [2024-11-11 17:13:52,870 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:13:52,870 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:52,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 110 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:13:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2024-11-11 17:13:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6584. [2024-11-11 17:13:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.077624183502962) internal successors, (7094), 6583 states have internal predecessors, (7094), 0 states have call successors, (0), 0 states 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:13:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 7094 transitions. [2024-11-11 17:13:52,949 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 7094 transitions. Word has length 884 [2024-11-11 17:13:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:52,949 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 7094 transitions. [2024-11-11 17:13:52,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 2 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:13:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 7094 transitions. [2024-11-11 17:13:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2024-11-11 17:13:52,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:52,963 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:13:52,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:13:52,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:52,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1518077249, now seen corresponding path program 1 times [2024-11-11 17:13:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872804465] [2024-11-11 17:13:52,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 976 proven. 0 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-11 17:13:53,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872804465] [2024-11-11 17:13:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872804465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:53,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095064995] [2024-11-11 17:13:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:53,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:53,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:53,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:53,638 INFO L87 Difference]: Start difference. First operand 6584 states and 7094 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:13:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:54,501 INFO L93 Difference]: Finished difference Result 14811 states and 16072 transitions. [2024-11-11 17:13:54,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:54,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 892 [2024-11-11 17:13:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:54,517 INFO L225 Difference]: With dead ends: 14811 [2024-11-11 17:13:54,517 INFO L226 Difference]: Without dead ends: 8887 [2024-11-11 17:13:54,524 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:13:54,524 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:54,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 438 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:13:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2024-11-11 17:13:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8558. [2024-11-11 17:13:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.065326633165829) internal successors, (9116), 8557 states have internal predecessors, (9116), 0 states have call successors, (0), 0 states 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:13:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9116 transitions. [2024-11-11 17:13:54,616 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9116 transitions. Word has length 892 [2024-11-11 17:13:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:54,617 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9116 transitions. [2024-11-11 17:13:54,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:13:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9116 transitions. [2024-11-11 17:13:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2024-11-11 17:13:54,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:54,632 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:13:54,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:13:54,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:54,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash -391937998, now seen corresponding path program 1 times [2024-11-11 17:13:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:54,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144248321] [2024-11-11 17:13:54,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 723 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-11-11 17:13:55,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:55,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144248321] [2024-11-11 17:13:55,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144248321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:55,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:55,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:55,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657562833] [2024-11-11 17:13:55,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:55,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:55,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:55,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:55,347 INFO L87 Difference]: Start difference. First operand 8558 states and 9116 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:13:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:56,136 INFO L93 Difference]: Finished difference Result 18101 states and 19362 transitions. [2024-11-11 17:13:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:56,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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 893 [2024-11-11 17:13:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:56,152 INFO L225 Difference]: With dead ends: 18101 [2024-11-11 17:13:56,152 INFO L226 Difference]: Without dead ends: 10203 [2024-11-11 17:13:56,161 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:13:56,161 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 136 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:56,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 433 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:13:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2024-11-11 17:13:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 10203. [2024-11-11 17:13:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 1.057243677710253) internal successors, (10786), 10202 states have internal predecessors, (10786), 0 states have call successors, (0), 0 states 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:13:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10786 transitions. [2024-11-11 17:13:56,287 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 10786 transitions. Word has length 893 [2024-11-11 17:13:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:56,288 INFO L471 AbstractCegarLoop]: Abstraction has 10203 states and 10786 transitions. [2024-11-11 17:13:56,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:13:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 10786 transitions. [2024-11-11 17:13:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2024-11-11 17:13:56,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:56,304 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:13:56,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:13:56,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:56,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash -642498199, now seen corresponding path program 1 times [2024-11-11 17:13:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:56,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597116809] [2024-11-11 17:13:56,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2024-11-11 17:13:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597116809] [2024-11-11 17:13:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597116809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806281712] [2024-11-11 17:13:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:57,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:57,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:57,012 INFO L87 Difference]: Start difference. First operand 10203 states and 10786 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:13:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:57,770 INFO L93 Difference]: Finished difference Result 25010 states and 26576 transitions. [2024-11-11 17:13:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:57,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 907 [2024-11-11 17:13:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:57,791 INFO L225 Difference]: With dead ends: 25010 [2024-11-11 17:13:57,791 INFO L226 Difference]: Without dead ends: 13493 [2024-11-11 17:13:57,802 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:13:57,804 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 143 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 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:13:57,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 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:13:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2024-11-11 17:13:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2024-11-11 17:13:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0472131633560628) internal successors, (14129), 13492 states have internal predecessors, (14129), 0 states have call successors, (0), 0 states 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:13:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 14129 transitions. [2024-11-11 17:13:58,003 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 14129 transitions. Word has length 907 [2024-11-11 17:13:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:58,003 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 14129 transitions. [2024-11-11 17:13:58,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:13:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 14129 transitions. [2024-11-11 17:13:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2024-11-11 17:13:58,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:58,028 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, 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, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:13:58,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:13:58,028 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:58,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1935670822, now seen corresponding path program 1 times [2024-11-11 17:13:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456520246] [2024-11-11 17:13:58,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:58,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:13:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-11-11 17:13:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:13:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456520246] [2024-11-11 17:13:58,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456520246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:13:58,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:13:58,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:13:58,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020175592] [2024-11-11 17:13:58,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:13:58,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:13:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:13:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:13:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:13:58,738 INFO L87 Difference]: Start difference. First operand 13493 states and 14129 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:13:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:13:59,423 INFO L93 Difference]: Finished difference Result 28958 states and 30389 transitions. [2024-11-11 17:13:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:13:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 1222 [2024-11-11 17:13:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:13:59,442 INFO L225 Difference]: With dead ends: 28958 [2024-11-11 17:13:59,442 INFO L226 Difference]: Without dead ends: 14809 [2024-11-11 17:13:59,457 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:13:59,458 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 172 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:13:59,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 410 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:13:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2024-11-11 17:13:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14480. [2024-11-11 17:13:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.037640721044271) internal successors, (15024), 14479 states have internal predecessors, (15024), 0 states have call successors, (0), 0 states 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:13:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15024 transitions. [2024-11-11 17:13:59,702 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15024 transitions. Word has length 1222 [2024-11-11 17:13:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:13:59,704 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15024 transitions. [2024-11-11 17:13:59,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:13:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15024 transitions. [2024-11-11 17:13:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2024-11-11 17:13:59,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:13:59,745 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:13:59,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 17:13:59,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:13:59,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:13:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 209054294, now seen corresponding path program 1 times [2024-11-11 17:13:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:13:59,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383176568] [2024-11-11 17:13:59,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:13:59,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:13:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:14:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 2000 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-11 17:14:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:14:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383176568] [2024-11-11 17:14:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383176568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:14:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:14:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:14:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510280813] [2024-11-11 17:14:01,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:14:01,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:14:01,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:14:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:14:01,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:14:01,231 INFO L87 Difference]: Start difference. First operand 14480 states and 15024 transitions. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:14:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:14:02,101 INFO L93 Difference]: Finished difference Result 28310 states and 29389 transitions. [2024-11-11 17:14:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 17:14:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 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 1299 [2024-11-11 17:14:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:14:02,114 INFO L225 Difference]: With dead ends: 28310 [2024-11-11 17:14:02,114 INFO L226 Difference]: Without dead ends: 14490 [2024-11-11 17:14:02,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:14:02,124 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:14:02,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 439 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:14:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14490 states. [2024-11-11 17:14:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14490 to 14151. [2024-11-11 17:14:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0378798586572437) internal successors, (14686), 14150 states have internal predecessors, (14686), 0 states have call successors, (0), 0 states 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:14:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14686 transitions. [2024-11-11 17:14:02,255 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14686 transitions. Word has length 1299 [2024-11-11 17:14:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:14:02,256 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14686 transitions. [2024-11-11 17:14:02,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:14:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14686 transitions. [2024-11-11 17:14:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1315 [2024-11-11 17:14:02,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:14:02,280 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:14:02,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 17:14:02,281 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:14:02,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:14:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1237442630, now seen corresponding path program 1 times [2024-11-11 17:14:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:14:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775244742] [2024-11-11 17:14:02,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:14:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:14:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:14:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2977 backedges. 2124 proven. 0 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2024-11-11 17:14:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:14:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775244742] [2024-11-11 17:14:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775244742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:14:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:14:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:14:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701834598] [2024-11-11 17:14:02,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:14:02,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:14:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:14:02,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:14:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:14:02,907 INFO L87 Difference]: Start difference. First operand 14151 states and 14686 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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:14:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:14:03,662 INFO L93 Difference]: Finished difference Result 27971 states and 29033 transitions. [2024-11-11 17:14:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:14:03,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 1314 [2024-11-11 17:14:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:14:03,676 INFO L225 Difference]: With dead ends: 27971 [2024-11-11 17:14:03,676 INFO L226 Difference]: Without dead ends: 14151 [2024-11-11 17:14:03,685 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:14:03,685 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:14:03,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 420 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:14:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2024-11-11 17:14:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2024-11-11 17:14:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0298097098618044) internal successors, (14233), 13821 states have internal predecessors, (14233), 0 states have call successors, (0), 0 states 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:14:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14233 transitions. [2024-11-11 17:14:03,920 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14233 transitions. Word has length 1314 [2024-11-11 17:14:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:14:03,921 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14233 transitions. [2024-11-11 17:14:03,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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:14:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14233 transitions. [2024-11-11 17:14:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1339 [2024-11-11 17:14:03,955 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:14:03,956 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, 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, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 17:14:03,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 17:14:03,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:14:03,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:14:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1877186863, now seen corresponding path program 1 times [2024-11-11 17:14:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:14:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368948795] [2024-11-11 17:14:03,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:14:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:14:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:14:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3052 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2024-11-11 17:14:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:14:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368948795] [2024-11-11 17:14:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368948795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:14:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:14:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:14:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840505925] [2024-11-11 17:14:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:14:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:14:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:14:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:14:04,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:14:04,872 INFO L87 Difference]: Start difference. First operand 13822 states and 14233 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:14:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:14:06,178 INFO L93 Difference]: Finished difference Result 30625 states and 31554 transitions. [2024-11-11 17:14:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 17:14:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1338 [2024-11-11 17:14:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:14:06,180 INFO L225 Difference]: With dead ends: 30625 [2024-11-11 17:14:06,180 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:14:06,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:14:06,193 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 633 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:14:06,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 48 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:14:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:14:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:14:06,194 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:14:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:14:06,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1338 [2024-11-11 17:14:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:14:06,195 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:14:06,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:14:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:14:06,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:14:06,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:14:06,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 17:14:06,202 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:14:06,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:14:06,924 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:14:06,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:14:06 BoogieIcfgContainer [2024-11-11 17:14:06,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:14:06,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:14:06,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:14:06,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:14:06,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:13:34" (3/4) ... [2024-11-11 17:14:06,952 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:14:06,980 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-11 17:14:06,982 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:14:06,984 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:14:06,985 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:14:07,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:14:07,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:14:07,198 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:14:07,198 INFO L158 Benchmark]: Toolchain (without parser) took 36169.47ms. Allocated memory was 169.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 108.9MB in the beginning and 854.5MB in the end (delta: -745.6MB). Peak memory consumption was 426.1MB. Max. memory is 16.1GB. [2024-11-11 17:14:07,199 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:14:07,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 954.14ms. Allocated memory is still 169.9MB. Free memory was 108.9MB in the beginning and 87.8MB in the end (delta: 21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 17:14:07,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.52ms. Allocated memory is still 169.9MB. Free memory was 87.8MB in the beginning and 63.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 17:14:07,200 INFO L158 Benchmark]: Boogie Preprocessor took 244.47ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 63.9MB in the beginning and 156.0MB in the end (delta: -92.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-11-11 17:14:07,201 INFO L158 Benchmark]: RCFGBuilder took 2072.36ms. Allocated memory is still 228.6MB. Free memory was 156.0MB in the beginning and 92.5MB in the end (delta: 63.5MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2024-11-11 17:14:07,201 INFO L158 Benchmark]: TraceAbstraction took 32468.95ms. Allocated memory was 228.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 91.5MB in the beginning and 879.7MB in the end (delta: -788.2MB). Peak memory consumption was 326.4MB. Max. memory is 16.1GB. [2024-11-11 17:14:07,201 INFO L158 Benchmark]: Witness Printer took 248.67ms. Allocated memory is still 1.3GB. Free memory was 879.7MB in the beginning and 854.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 17:14:07,203 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.17ms. Allocated memory is still 96.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 954.14ms. Allocated memory is still 169.9MB. Free memory was 108.9MB in the beginning and 87.8MB in the end (delta: 21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.52ms. Allocated memory is still 169.9MB. Free memory was 87.8MB in the beginning and 63.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 244.47ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 63.9MB in the beginning and 156.0MB in the end (delta: -92.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2072.36ms. Allocated memory is still 228.6MB. Free memory was 156.0MB in the beginning and 92.5MB in the end (delta: 63.5MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. * TraceAbstraction took 32468.95ms. Allocated memory was 228.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 91.5MB in the beginning and 879.7MB in the end (delta: -788.2MB). Peak memory consumption was 326.4MB. Max. memory is 16.1GB. * Witness Printer took 248.67ms. Allocated memory is still 1.3GB. Free memory was 879.7MB in the beginning and 854.5MB in the end (delta: 25.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: 119]: 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: 31.6s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3902 SdHoareTripleChecker+Valid, 15.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3902 mSDsluCounter, 4080 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 2401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16358 IncrementalHoareTripleChecker+Invalid, 18759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2401 mSolverCounterUnsat, 3895 mSDtfsCounter, 16358 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14480occurred in iteration=13, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 2642 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 11548 NumberOfCodeBlocks, 11548 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 11530 ConstructedInterpolants, 0 QuantifiedInterpolants, 27503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 18146/18230 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 == 10) && (a12 == 8)) && (a15 == 3)) || ((((a15 <= 3) && (a12 == 8)) && (((long long) 87 + a18) <= 0)) && (a16 <= 11))) || ((a16 == 8) && (a15 <= 3))) || ((a12 <= 7) && (a16 <= 11))) || (((a16 == 9) && (a15 <= 3)) && (a18 <= 134))) || (((a12 == 9) && (a16 == 9)) && (a15 <= 3))) || (((a16 == 8) && (a12 == 8)) && (a18 <= 134))) || ((((a12 == 9) && (a15 <= 3)) && (((long long) 87 + a18) <= 0)) && (a16 <= 11))) || ((a15 <= 3) && (a12 <= 7))) || ((a12 == 9) && (a16 == 8))) || (((a16 == 9) && (a12 == 8)) && (a18 <= 134))) || (((a12 == 9) && (a16 == 9)) && (a18 <= 134))) || (((a15 <= 3) && (a12 == 8)) && (11 <= a16))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:14:07,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE