./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:20:17,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:20:17,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:20:18,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:20:18,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:20:18,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:20:18,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:20:18,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:20:18,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:20:18,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:20:18,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:20:18,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:20:18,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:20:18,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:20:18,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:20:18,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:20:18,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:20:18,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:20:18,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:20:18,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:20:18,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:20:18,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:20:18,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:20:18,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:20:18,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:20:18,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:20:18,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:20:18,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:20:18,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:20:18,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:20:18,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:20:18,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:20:18,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:20:18,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:20:18,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:20:18,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:20:18,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:20:18,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:20:18,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:20:18,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:20:18,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:20:18,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:20:18,086 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:20:18,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:20:18,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:20:18,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:20:18,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:20:18,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:20:18,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:20:18,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:20:18,089 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:20:18,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:20:18,090 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:20:18,090 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:20:18,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:20:18,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:20:18,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:20:18,091 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:20:18,091 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:20:18,091 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:20:18,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:20:18,091 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:20:18,092 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:20:18,092 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:20:18,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:20:18,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:20:18,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:20:18,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:20:18,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:20:18,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:20:18,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:20:18,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:20:18,093 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:20:18,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2021-12-22 00:20:18,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:20:18,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:20:18,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:20:18,349 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:20:18,363 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:20:18,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-12-22 00:20:18,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7def564/a73c08f597e24050a6e1862529be12c7/FLAG50c60654a [2021-12-22 00:20:18,761 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:20:18,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-12-22 00:20:18,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7def564/a73c08f597e24050a6e1862529be12c7/FLAG50c60654a [2021-12-22 00:20:19,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7def564/a73c08f597e24050a6e1862529be12c7 [2021-12-22 00:20:19,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:20:19,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:20:19,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:20:19,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:20:19,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:20:19,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f3f8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19, skipping insertion in model container [2021-12-22 00:20:19,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:20:19,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:20:19,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:20:19,368 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:20:19,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:20:19,390 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:20:19,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19 WrapperNode [2021-12-22 00:20:19,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:20:19,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:20:19,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:20:19,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:20:19,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,415 INFO L137 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2021-12-22 00:20:19,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:20:19,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:20:19,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:20:19,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:20:19,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:20:19,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:20:19,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:20:19,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:20:19,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (1/1) ... [2021-12-22 00:20:19,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:20:19,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:19,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 00:20:19,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 00:20:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:20:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 00:20:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 00:20:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 00:20:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:20:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:20:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 00:20:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:20:19,532 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:20:19,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:20:19,744 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:20:19,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:20:19,749 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-22 00:20:19,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:20:19 BoogieIcfgContainer [2021-12-22 00:20:19,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:20:19,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:20:19,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:20:19,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:20:19,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:20:19" (1/3) ... [2021-12-22 00:20:19,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236a7805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:20:19, skipping insertion in model container [2021-12-22 00:20:19,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:19" (2/3) ... [2021-12-22 00:20:19,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236a7805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:20:19, skipping insertion in model container [2021-12-22 00:20:19,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:20:19" (3/3) ... [2021-12-22 00:20:19,769 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2021-12-22 00:20:19,773 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:20:19,773 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-12-22 00:20:19,803 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:20:19,808 INFO L339 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 00:20:19,808 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-12-22 00:20:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-22 00:20:19,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:19,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-22 00:20:19,824 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-22 00:20:19,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:19,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238622093] [2021-12-22 00:20:19,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:19,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:19,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:19,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238622093] [2021-12-22 00:20:19,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238622093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:19,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:19,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-22 00:20:19,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974049018] [2021-12-22 00:20:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:19,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:20:19,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:20,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:20:20,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:20:20,016 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 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, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:20,078 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-12-22 00:20:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:20:20,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-22 00:20:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:20,086 INFO L225 Difference]: With dead ends: 52 [2021-12-22 00:20:20,086 INFO L226 Difference]: Without dead ends: 50 [2021-12-22 00:20:20,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:20:20,093 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:20,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-22 00:20:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-22 00:20:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-22 00:20:20,118 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2021-12-22 00:20:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:20,119 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-22 00:20:20,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-22 00:20:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-22 00:20:20,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:20,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-22 00:20:20,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 00:20:20,122 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2021-12-22 00:20:20,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:20,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757247157] [2021-12-22 00:20:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:20,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:20,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:20,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757247157] [2021-12-22 00:20:20,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757247157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:20,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:20,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:20:20,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86254967] [2021-12-22 00:20:20,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:20,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:20:20,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:20,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:20:20,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:20:20,185 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:20,223 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-22 00:20:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:20:20,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-22 00:20:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:20,224 INFO L225 Difference]: With dead ends: 53 [2021-12-22 00:20:20,224 INFO L226 Difference]: Without dead ends: 53 [2021-12-22 00:20:20,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:20:20,226 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:20,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-22 00:20:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-12-22 00:20:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-12-22 00:20:20,231 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2021-12-22 00:20:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:20,231 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-12-22 00:20:20,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-12-22 00:20:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 00:20:20,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:20,232 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-12-22 00:20:20,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 00:20:20,233 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:20,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2021-12-22 00:20:20,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:20,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098949231] [2021-12-22 00:20:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:20,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:20,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:20,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098949231] [2021-12-22 00:20:20,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098949231] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:20,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168640477] [2021-12-22 00:20:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:20,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:20,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:20,337 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) [2021-12-22 00:20:20,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 00:20:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:20,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 00:20:20,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:20,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:20,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168640477] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:20,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:20,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2021-12-22 00:20:20,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936482034] [2021-12-22 00:20:20,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:20,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:20:20,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:20:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:20:20,553 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:20,729 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-12-22 00:20:20,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:20:20,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 7 [2021-12-22 00:20:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:20,733 INFO L225 Difference]: With dead ends: 59 [2021-12-22 00:20:20,733 INFO L226 Difference]: Without dead ends: 59 [2021-12-22 00:20:20,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-12-22 00:20:20,737 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 179 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:20,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 126 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:20:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-22 00:20:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-22 00:20:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-12-22 00:20:20,748 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2021-12-22 00:20:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:20,748 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-12-22 00:20:20,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-12-22 00:20:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 00:20:20,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:20,749 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:20,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:20,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:20,965 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2021-12-22 00:20:20,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:20,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127987292] [2021-12-22 00:20:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:20,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:21,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127987292] [2021-12-22 00:20:21,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127987292] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258615558] [2021-12-22 00:20:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:21,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:21,057 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) [2021-12-22 00:20:21,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 00:20:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:21,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 00:20:21,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:21,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:21,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258615558] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:21,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:21,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-22 00:20:21,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486596034] [2021-12-22 00:20:21,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:21,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 00:20:21,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 00:20:21,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:20:21,217 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:21,248 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-12-22 00:20:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:20:21,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 00:20:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:21,249 INFO L225 Difference]: With dead ends: 77 [2021-12-22 00:20:21,249 INFO L226 Difference]: Without dead ends: 77 [2021-12-22 00:20:21,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:20:21,250 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:21,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 290 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-22 00:20:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-22 00:20:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2021-12-22 00:20:21,254 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2021-12-22 00:20:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:21,254 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2021-12-22 00:20:21,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2021-12-22 00:20:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:20:21,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:21,255 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:21,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:21,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-22 00:20:21,459 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2021-12-22 00:20:21,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:21,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479960372] [2021-12-22 00:20:21,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:21,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:21,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479960372] [2021-12-22 00:20:21,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479960372] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623848718] [2021-12-22 00:20:21,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:20:21,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:21,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:21,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:21,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 00:20:21,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 00:20:21,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:20:21,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-22 00:20:21,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:21,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:20:21,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623848718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:21,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 00:20:21,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 17 [2021-12-22 00:20:21,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512303658] [2021-12-22 00:20:21,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:21,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:20:21,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:20:21,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-12-22 00:20:21,973 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:22,032 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-12-22 00:20:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:20:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-22 00:20:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:22,033 INFO L225 Difference]: With dead ends: 85 [2021-12-22 00:20:22,033 INFO L226 Difference]: Without dead ends: 85 [2021-12-22 00:20:22,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-12-22 00:20:22,034 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 111 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:22,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 64 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-22 00:20:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2021-12-22 00:20:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-12-22 00:20:22,037 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2021-12-22 00:20:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:22,038 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-12-22 00:20:22,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-12-22 00:20:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:20:22,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:22,039 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:22,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:22,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:22,257 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2021-12-22 00:20:22,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:22,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909822557] [2021-12-22 00:20:22,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:22,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-22 00:20:22,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:22,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909822557] [2021-12-22 00:20:22,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909822557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:22,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:22,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:20:22,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590639339] [2021-12-22 00:20:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:22,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:20:22,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:20:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:20:22,307 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:22,341 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-12-22 00:20:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:20:22,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-22 00:20:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:22,342 INFO L225 Difference]: With dead ends: 78 [2021-12-22 00:20:22,342 INFO L226 Difference]: Without dead ends: 78 [2021-12-22 00:20:22,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:20:22,343 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:22,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-22 00:20:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-22 00:20:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-12-22 00:20:22,347 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2021-12-22 00:20:22,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:22,347 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-12-22 00:20:22,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-12-22 00:20:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 00:20:22,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:22,348 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:22,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 00:20:22,348 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:22,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2021-12-22 00:20:22,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:22,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195123927] [2021-12-22 00:20:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:22,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:22,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:22,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195123927] [2021-12-22 00:20:22,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195123927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:22,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:22,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-22 00:20:22,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065271315] [2021-12-22 00:20:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:22,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:20:22,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:20:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:20:22,392 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:22,407 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-12-22 00:20:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:20:22,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 38 [2021-12-22 00:20:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:22,408 INFO L225 Difference]: With dead ends: 77 [2021-12-22 00:20:22,408 INFO L226 Difference]: Without dead ends: 77 [2021-12-22 00:20:22,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:20:22,409 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:22,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-22 00:20:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-22 00:20:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2021-12-22 00:20:22,412 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 38 [2021-12-22 00:20:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:22,412 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2021-12-22 00:20:22,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2021-12-22 00:20:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 00:20:22,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:22,413 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:22,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 00:20:22,413 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2021-12-22 00:20:22,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:22,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13312198] [2021-12-22 00:20:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:22,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:22,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13312198] [2021-12-22 00:20:22,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13312198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:22,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:22,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:20:22,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412229169] [2021-12-22 00:20:22,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:22,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:20:22,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:22,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:20:22,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:20:22,479 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:22,511 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-22 00:20:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:20:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 38 [2021-12-22 00:20:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:22,512 INFO L225 Difference]: With dead ends: 80 [2021-12-22 00:20:22,512 INFO L226 Difference]: Without dead ends: 80 [2021-12-22 00:20:22,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:20:22,513 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:22,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 60 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-22 00:20:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2021-12-22 00:20:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-12-22 00:20:22,516 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2021-12-22 00:20:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:22,517 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-12-22 00:20:22,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-12-22 00:20:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-22 00:20:22,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:22,518 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:22,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 00:20:22,518 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2021-12-22 00:20:22,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:22,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802550806] [2021-12-22 00:20:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:22,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 100 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:22,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:22,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802550806] [2021-12-22 00:20:22,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802550806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:22,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481119198] [2021-12-22 00:20:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:22,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:22,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:22,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:22,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 00:20:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:22,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-22 00:20:22,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:23,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:23,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481119198] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:23,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:23,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4, 4] total 23 [2021-12-22 00:20:23,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994245183] [2021-12-22 00:20:23,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:23,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-22 00:20:23,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-22 00:20:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2021-12-22 00:20:23,337 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:23,752 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-22 00:20:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 00:20:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 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 42 [2021-12-22 00:20:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:23,755 INFO L225 Difference]: With dead ends: 98 [2021-12-22 00:20:23,755 INFO L226 Difference]: Without dead ends: 98 [2021-12-22 00:20:23,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2021-12-22 00:20:23,756 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 471 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:23,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 155 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:20:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-22 00:20:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2021-12-22 00:20:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 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) [2021-12-22 00:20:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2021-12-22 00:20:23,759 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2021-12-22 00:20:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:23,759 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2021-12-22 00:20:23,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2021-12-22 00:20:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-22 00:20:23,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:23,760 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:23,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:23,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:23,971 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2021-12-22 00:20:23,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:23,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653812049] [2021-12-22 00:20:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:23,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:24,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:24,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653812049] [2021-12-22 00:20:24,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653812049] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:24,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678834658] [2021-12-22 00:20:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:24,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:24,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:24,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 00:20:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:24,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 00:20:24,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:24,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:24,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678834658] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:24,692 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:24,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2021-12-22 00:20:24,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109330375] [2021-12-22 00:20:24,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:24,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:20:24,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:20:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:20:24,694 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:24,821 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2021-12-22 00:20:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:20:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 43 [2021-12-22 00:20:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:24,822 INFO L225 Difference]: With dead ends: 93 [2021-12-22 00:20:24,822 INFO L226 Difference]: Without dead ends: 93 [2021-12-22 00:20:24,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:20:24,822 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 126 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:24,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 92 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-22 00:20:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-22 00:20:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2021-12-22 00:20:24,825 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2021-12-22 00:20:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:24,826 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2021-12-22 00:20:24,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2021-12-22 00:20:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-22 00:20:24,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:24,827 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:24,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:25,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-22 00:20:25,041 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2021-12-22 00:20:25,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:25,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62347402] [2021-12-22 00:20:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:25,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 100 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:20:25,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62347402] [2021-12-22 00:20:25,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62347402] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562163047] [2021-12-22 00:20:25,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:20:25,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:25,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:25,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 00:20:25,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 00:20:25,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:20:25,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-22 00:20:25,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:25,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:26,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562163047] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:26,167 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:26,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2021-12-22 00:20:26,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116914230] [2021-12-22 00:20:26,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:26,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-22 00:20:26,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-22 00:20:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2021-12-22 00:20:26,169 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:26,860 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2021-12-22 00:20:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-22 00:20:26,860 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-12-22 00:20:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:26,861 INFO L225 Difference]: With dead ends: 137 [2021-12-22 00:20:26,861 INFO L226 Difference]: Without dead ends: 137 [2021-12-22 00:20:26,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2021-12-22 00:20:26,863 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 663 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:26,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 270 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:20:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-22 00:20:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2021-12-22 00:20:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2021-12-22 00:20:26,866 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 57 [2021-12-22 00:20:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:26,866 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2021-12-22 00:20:26,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2021-12-22 00:20:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 00:20:26,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:26,886 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:26,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:27,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:27,103 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2021-12-22 00:20:27,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:27,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853615264] [2021-12-22 00:20:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:27,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:27,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:27,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853615264] [2021-12-22 00:20:27,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853615264] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:27,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627493537] [2021-12-22 00:20:27,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:20:27,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:27,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:27,259 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:27,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 00:20:27,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 00:20:27,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:20:27,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 00:20:27,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-22 00:20:27,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-22 00:20:28,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627493537] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:28,448 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:28,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2021-12-22 00:20:28,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680682700] [2021-12-22 00:20:28,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:28,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 00:20:28,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:28,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 00:20:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-12-22 00:20:28,449 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:28,798 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2021-12-22 00:20:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:20:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-22 00:20:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:28,799 INFO L225 Difference]: With dead ends: 121 [2021-12-22 00:20:28,799 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 00:20:28,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-12-22 00:20:28,800 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 366 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:28,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 268 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:20:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 00:20:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-22 00:20:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2021-12-22 00:20:28,802 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 58 [2021-12-22 00:20:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:28,818 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2021-12-22 00:20:28,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2021-12-22 00:20:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-22 00:20:28,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:28,819 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:28,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:29,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:29,026 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2021-12-22 00:20:29,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:29,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445845385] [2021-12-22 00:20:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:29,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:29,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:29,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445845385] [2021-12-22 00:20:29,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445845385] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:29,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996950095] [2021-12-22 00:20:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:29,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:29,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:29,126 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:29,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 00:20:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:29,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 00:20:29,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:29,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:29,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996950095] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:29,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:29,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-12-22 00:20:29,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120029794] [2021-12-22 00:20:29,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:29,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 00:20:29,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 00:20:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:20:29,391 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:29,427 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-12-22 00:20:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:20:29,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 70 [2021-12-22 00:20:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:29,428 INFO L225 Difference]: With dead ends: 121 [2021-12-22 00:20:29,428 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 00:20:29,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:20:29,429 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:29,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 178 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 00:20:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-22 00:20:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2021-12-22 00:20:29,431 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 70 [2021-12-22 00:20:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:29,432 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2021-12-22 00:20:29,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2021-12-22 00:20:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-22 00:20:29,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:29,433 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:29,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:29,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-22 00:20:29,648 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:29,649 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2021-12-22 00:20:29,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:29,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003573723] [2021-12-22 00:20:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:29,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-22 00:20:29,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:29,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003573723] [2021-12-22 00:20:29,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003573723] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:29,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083996881] [2021-12-22 00:20:29,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 00:20:29,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:29,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:29,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 00:20:29,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-22 00:20:29,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:20:29,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 00:20:29,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-12-22 00:20:30,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:20:30,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083996881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:30,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 00:20:30,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2021-12-22 00:20:30,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238200706] [2021-12-22 00:20:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:30,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:20:30,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:30,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:20:30,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-12-22 00:20:30,287 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:30,353 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-12-22 00:20:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:20:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 87 [2021-12-22 00:20:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:30,354 INFO L225 Difference]: With dead ends: 120 [2021-12-22 00:20:30,354 INFO L226 Difference]: Without dead ends: 120 [2021-12-22 00:20:30,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-12-22 00:20:30,355 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 159 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:30,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 66 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-22 00:20:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-12-22 00:20:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2021-12-22 00:20:30,357 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 87 [2021-12-22 00:20:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:30,357 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2021-12-22 00:20:30,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2021-12-22 00:20:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-22 00:20:30,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:30,358 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:30,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:30,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-22 00:20:30,575 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2021-12-22 00:20:30,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:30,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363007141] [2021-12-22 00:20:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:30,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:30,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:30,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363007141] [2021-12-22 00:20:30,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363007141] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:30,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:30,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:20:30,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301433704] [2021-12-22 00:20:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:30,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:20:30,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:30,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:20:30,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:20:30,637 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:30,666 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-12-22 00:20:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:20:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 90 [2021-12-22 00:20:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:30,667 INFO L225 Difference]: With dead ends: 118 [2021-12-22 00:20:30,667 INFO L226 Difference]: Without dead ends: 118 [2021-12-22 00:20:30,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:20:30,668 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:30,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-22 00:20:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-22 00:20:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2021-12-22 00:20:30,670 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2021-12-22 00:20:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:30,671 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2021-12-22 00:20:30,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2021-12-22 00:20:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-22 00:20:30,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:30,671 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:30,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 00:20:30,672 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2021-12-22 00:20:30,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:30,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203439015] [2021-12-22 00:20:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:30,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-22 00:20:30,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:30,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203439015] [2021-12-22 00:20:30,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203439015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:30,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:30,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:20:30,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225590633] [2021-12-22 00:20:30,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:30,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:20:30,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:20:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:20:30,753 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:30,807 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2021-12-22 00:20:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:20:30,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 90 [2021-12-22 00:20:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:30,809 INFO L225 Difference]: With dead ends: 125 [2021-12-22 00:20:30,809 INFO L226 Difference]: Without dead ends: 125 [2021-12-22 00:20:30,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:20:30,809 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:30,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-22 00:20:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2021-12-22 00:20:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2021-12-22 00:20:30,811 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2021-12-22 00:20:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:30,812 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2021-12-22 00:20:30,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2021-12-22 00:20:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-22 00:20:30,812 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:30,812 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:30,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 00:20:30,813 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:30,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2021-12-22 00:20:30,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:30,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136530802] [2021-12-22 00:20:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:30,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:30,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:30,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136530802] [2021-12-22 00:20:30,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136530802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:30,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:30,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:20:30,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218840879] [2021-12-22 00:20:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:30,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:20:30,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:30,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:20:30,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:20:30,849 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:30,860 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2021-12-22 00:20:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:20:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 91 [2021-12-22 00:20:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:30,861 INFO L225 Difference]: With dead ends: 119 [2021-12-22 00:20:30,861 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 00:20:30,861 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:20:30,862 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:30,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 00:20:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-22 00:20:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2021-12-22 00:20:30,864 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2021-12-22 00:20:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:30,864 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2021-12-22 00:20:30,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2021-12-22 00:20:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-22 00:20:30,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:30,865 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:30,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 00:20:30,865 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2021-12-22 00:20:30,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:30,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543841907] [2021-12-22 00:20:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:30,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:30,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:30,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543841907] [2021-12-22 00:20:30,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543841907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:30,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:20:30,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:20:30,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734860681] [2021-12-22 00:20:30,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:30,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:20:30,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:30,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:20:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:20:30,900 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:30,916 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-12-22 00:20:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:20:30,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 91 [2021-12-22 00:20:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:30,917 INFO L225 Difference]: With dead ends: 122 [2021-12-22 00:20:30,917 INFO L226 Difference]: Without dead ends: 122 [2021-12-22 00:20:30,917 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:20:30,917 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:30,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-22 00:20:30,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2021-12-22 00:20:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2021-12-22 00:20:30,919 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2021-12-22 00:20:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:30,919 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2021-12-22 00:20:30,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2021-12-22 00:20:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-22 00:20:30,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:30,920 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:30,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 00:20:30,921 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2021-12-22 00:20:30,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:30,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284877242] [2021-12-22 00:20:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:30,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-22 00:20:31,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:31,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284877242] [2021-12-22 00:20:31,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284877242] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:31,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104468860] [2021-12-22 00:20:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:31,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:31,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:31,033 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:31,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 00:20:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:31,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-22 00:20:31,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:31,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:20:31,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-22 00:20:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:31,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:32,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104468860] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:32,833 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:32,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2021-12-22 00:20:32,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709171801] [2021-12-22 00:20:32,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:32,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 00:20:32,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 00:20:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:20:32,834 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:33,080 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2021-12-22 00:20:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:20:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 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 95 [2021-12-22 00:20:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:33,081 INFO L225 Difference]: With dead ends: 180 [2021-12-22 00:20:33,081 INFO L226 Difference]: Without dead ends: 180 [2021-12-22 00:20:33,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2021-12-22 00:20:33,081 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 271 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:33,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 230 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 158 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2021-12-22 00:20:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-22 00:20:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2021-12-22 00:20:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2021-12-22 00:20:33,083 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2021-12-22 00:20:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:33,083 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2021-12-22 00:20:33,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2021-12-22 00:20:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-22 00:20:33,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:33,084 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:33,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:33,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:33,285 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2021-12-22 00:20:33,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:33,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321747389] [2021-12-22 00:20:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:33,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:33,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:33,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321747389] [2021-12-22 00:20:33,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321747389] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:33,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869145888] [2021-12-22 00:20:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:33,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:33,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:33,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:33,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-22 00:20:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:33,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 00:20:33,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:33,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:20:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:33,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:33,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869145888] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:33,662 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:33,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2021-12-22 00:20:33,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806388526] [2021-12-22 00:20:33,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:33,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:20:33,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:20:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:20:33,663 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:33,724 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-12-22 00:20:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:20:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 96 [2021-12-22 00:20:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:33,725 INFO L225 Difference]: With dead ends: 137 [2021-12-22 00:20:33,725 INFO L226 Difference]: Without dead ends: 137 [2021-12-22 00:20:33,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:20:33,726 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:33,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 124 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-22 00:20:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-12-22 00:20:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2021-12-22 00:20:33,735 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2021-12-22 00:20:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:33,735 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2021-12-22 00:20:33,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2021-12-22 00:20:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-22 00:20:33,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:33,736 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:33,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:33,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:33,953 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2021-12-22 00:20:33,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:33,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401040836] [2021-12-22 00:20:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:33,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:33,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401040836] [2021-12-22 00:20:33,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401040836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19628959] [2021-12-22 00:20:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:33,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:33,992 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:33,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-22 00:20:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:34,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:20:34,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:34,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:34,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19628959] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:34,380 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:34,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-22 00:20:34,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541533730] [2021-12-22 00:20:34,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:34,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:20:34,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:34,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:20:34,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:20:34,381 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:34,416 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2021-12-22 00:20:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:20:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 103 [2021-12-22 00:20:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:34,417 INFO L225 Difference]: With dead ends: 145 [2021-12-22 00:20:34,417 INFO L226 Difference]: Without dead ends: 145 [2021-12-22 00:20:34,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:20:34,418 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:34,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 120 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:20:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-22 00:20:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2021-12-22 00:20:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2021-12-22 00:20:34,421 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2021-12-22 00:20:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:34,421 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2021-12-22 00:20:34,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2021-12-22 00:20:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-22 00:20:34,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:34,422 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:34,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-22 00:20:34,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-22 00:20:34,639 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2021-12-22 00:20:34,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:34,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988869235] [2021-12-22 00:20:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:34,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-22 00:20:34,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:34,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988869235] [2021-12-22 00:20:34,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988869235] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:34,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066416410] [2021-12-22 00:20:34,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:20:34,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:34,857 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:34,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-22 00:20:34,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 00:20:34,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:20:34,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-22 00:20:34,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:35,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:20:35,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-22 00:20:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:35,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:20:35,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066416410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:20:35,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 00:20:35,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2021-12-22 00:20:35,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211134929] [2021-12-22 00:20:35,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:20:35,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:20:35,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:20:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-12-22 00:20:35,883 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:36,068 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2021-12-22 00:20:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:20:36,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 110 [2021-12-22 00:20:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:36,071 INFO L225 Difference]: With dead ends: 142 [2021-12-22 00:20:36,071 INFO L226 Difference]: Without dead ends: 142 [2021-12-22 00:20:36,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2021-12-22 00:20:36,071 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 135 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:36,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 96 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:20:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-22 00:20:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-12-22 00:20:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2021-12-22 00:20:36,073 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 110 [2021-12-22 00:20:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:36,073 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2021-12-22 00:20:36,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2021-12-22 00:20:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-22 00:20:36,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:36,074 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:36,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:36,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-22 00:20:36,284 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:36,285 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2021-12-22 00:20:36,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:36,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756318290] [2021-12-22 00:20:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:36,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:36,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:36,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756318290] [2021-12-22 00:20:36,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756318290] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:36,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786945154] [2021-12-22 00:20:36,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:20:36,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:36,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:36,415 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:36,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-22 00:20:36,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 00:20:36,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:20:36,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 00:20:36,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:36,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:20:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-22 00:20:36,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-22 00:20:37,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786945154] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:37,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:37,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2021-12-22 00:20:37,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423222022] [2021-12-22 00:20:37,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:37,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-22 00:20:37,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 00:20:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-12-22 00:20:37,387 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:37,659 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-12-22 00:20:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:20:37,659 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 111 [2021-12-22 00:20:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:37,660 INFO L225 Difference]: With dead ends: 142 [2021-12-22 00:20:37,660 INFO L226 Difference]: Without dead ends: 142 [2021-12-22 00:20:37,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2021-12-22 00:20:37,661 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 249 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:37,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 198 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:20:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-22 00:20:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2021-12-22 00:20:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2021-12-22 00:20:37,663 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 111 [2021-12-22 00:20:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:37,663 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2021-12-22 00:20:37,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2021-12-22 00:20:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-22 00:20:37,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:37,664 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:37,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:37,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:37,878 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2021-12-22 00:20:37,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:37,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512250991] [2021-12-22 00:20:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:37,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:20:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:37,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:20:37,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512250991] [2021-12-22 00:20:37,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512250991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:20:37,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331308858] [2021-12-22 00:20:37,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:20:37,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:37,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:20:37,937 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:20:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-22 00:20:38,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 00:20:38,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:20:38,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 00:20:38,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:20:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:38,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:20:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-22 00:20:38,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331308858] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:20:38,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:20:38,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-12-22 00:20:38,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704905571] [2021-12-22 00:20:38,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:20:38,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 00:20:38,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:20:38,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 00:20:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:20:38,320 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:20:38,380 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2021-12-22 00:20:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:20:38,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 123 [2021-12-22 00:20:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:20:38,381 INFO L225 Difference]: With dead ends: 161 [2021-12-22 00:20:38,381 INFO L226 Difference]: Without dead ends: 161 [2021-12-22 00:20:38,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:20:38,382 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:20:38,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 199 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:20:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-22 00:20:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-12-22 00:20:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2021-12-22 00:20:38,385 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 123 [2021-12-22 00:20:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:20:38,385 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2021-12-22 00:20:38,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:20:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2021-12-22 00:20:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-22 00:20:38,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:20:38,386 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:38,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-22 00:20:38,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:20:38,600 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-22 00:20:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:20:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2021-12-22 00:20:38,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:20:38,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030901984] [2021-12-22 00:20:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:20:38,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:20:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:20:38,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 00:20:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:20:38,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 00:20:38,741 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 00:20:38,742 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (16 of 17 remaining) [2021-12-22 00:20:38,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (15 of 17 remaining) [2021-12-22 00:20:38,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (14 of 17 remaining) [2021-12-22 00:20:38,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (13 of 17 remaining) [2021-12-22 00:20:38,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (12 of 17 remaining) [2021-12-22 00:20:38,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (11 of 17 remaining) [2021-12-22 00:20:38,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (10 of 17 remaining) [2021-12-22 00:20:38,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (9 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (8 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (7 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (6 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (5 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (4 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (3 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (2 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (1 of 17 remaining) [2021-12-22 00:20:38,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2021-12-22 00:20:38,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 00:20:38,746 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:20:38,749 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 00:20:38,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 12:20:38 BoogieIcfgContainer [2021-12-22 00:20:38,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 00:20:38,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 00:20:38,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 00:20:38,819 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 00:20:38,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:20:19" (3/4) ... [2021-12-22 00:20:38,821 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 00:20:38,860 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 00:20:38,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 00:20:38,860 INFO L158 Benchmark]: Toolchain (without parser) took 19654.35ms. Allocated memory was 109.1MB in the beginning and 343.9MB in the end (delta: 234.9MB). Free memory was 81.6MB in the beginning and 118.2MB in the end (delta: -36.7MB). Peak memory consumption was 198.9MB. Max. memory is 16.1GB. [2021-12-22 00:20:38,861 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory was 66.8MB in the beginning and 66.8MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:20:38,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.59ms. Allocated memory was 109.1MB in the beginning and 161.5MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 137.9MB in the end (delta: -56.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 00:20:38,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.28ms. Allocated memory is still 161.5MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:20:38,861 INFO L158 Benchmark]: Boogie Preprocessor took 17.13ms. Allocated memory is still 161.5MB. Free memory was 135.8MB in the beginning and 134.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:20:38,861 INFO L158 Benchmark]: RCFGBuilder took 317.34ms. Allocated memory is still 161.5MB. Free memory was 134.3MB in the beginning and 120.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 00:20:38,862 INFO L158 Benchmark]: TraceAbstraction took 19066.53ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 119.6MB in the beginning and 128.7MB in the end (delta: -9.1MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. [2021-12-22 00:20:38,862 INFO L158 Benchmark]: Witness Printer took 41.14ms. Allocated memory is still 343.9MB. Free memory was 128.7MB in the beginning and 118.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 00:20:38,863 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory was 66.8MB in the beginning and 66.8MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.59ms. Allocated memory was 109.1MB in the beginning and 161.5MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 137.9MB in the end (delta: -56.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.28ms. Allocated memory is still 161.5MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.13ms. Allocated memory is still 161.5MB. Free memory was 135.8MB in the beginning and 134.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.34ms. Allocated memory is still 161.5MB. Free memory was 134.3MB in the beginning and 120.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19066.53ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 119.6MB in the beginning and 128.7MB in the end (delta: -9.1MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. * Witness Printer took 41.14ms. Allocated memory is still 343.9MB. Free memory was 128.7MB in the beginning and 118.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [array={2:0}, numbers2={3:0}, numbers4={4:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L8] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L12] return array; VAL [\result={2:0}, array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L18] ++i VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L18] ++i VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L18] ++i VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L18] ++i VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L18] ++i VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L18] ++i VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L18] ++i VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L18] ++i VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L18] ++i VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L18] ++i VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L21] return numbers2; VAL [\result={3:0}, array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L27] ++i VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L27] ++i VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L27] ++i VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L27] ++i VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L27] ++i VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L27] ++i VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L27] ++i VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L27] ++i VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L27] ++i VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L27] ++i VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={11:0}, array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers4={4:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L37] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L38] numbers[i] - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3212 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3212 mSDsluCounter, 3127 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 29 IncrementalHoareTripleChecker+Unchecked, 2249 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2754 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 878 mSDtfsCounter, 2754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2099 GetRequests, 1769 SyntacticMatches, 2 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=24, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 89 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2742 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3372 ConstructedInterpolants, 87 QuantifiedInterpolants, 28391 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3619 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 51 InterpolantComputations, 12 PerfectInterpolantSequences, 11661/12711 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 RESULT: Ultimate proved your program to be incorrect! [2021-12-22 00:20:38,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)