./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/list-simple/dll2c_update_all.i -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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 06:01:15,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 06:01:15,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 06:01:15,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 06:01:15,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 06:01:15,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 06:01:15,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 06:01:15,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 06:01:15,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 06:01:15,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 06:01:15,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 06:01:15,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 06:01:15,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 06:01:15,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 06:01:15,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 06:01:15,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 06:01:15,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 06:01:15,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 06:01:15,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 06:01:15,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 06:01:15,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 06:01:15,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 06:01:15,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 06:01:15,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 06:01:15,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 06:01:15,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 06:01:15,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 06:01:15,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 06:01:15,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 06:01:15,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 06:01:15,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 06:01:15,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 06:01:15,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 06:01:15,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 06:01:15,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 06:01:15,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 06:01:15,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 06:01:15,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 06:01:15,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 06:01:15,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 06:01:15,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 06:01:15,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 06:01:15,563 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 06:01:15,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 06:01:15,564 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 06:01:15,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 06:01:15,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 06:01:15,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 06:01:15,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 06:01:15,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 06:01:15,568 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 06:01:15,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 06:01:15,569 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 06:01:15,569 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 06:01:15,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 06:01:15,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 06:01:15,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 06:01:15,570 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 06:01:15,570 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 06:01:15,570 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 06:01:15,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 06:01:15,570 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 06:01:15,571 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 06:01:15,571 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 06:01:15,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 06:01:15,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 06:01:15,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 06:01:15,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:01:15,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 06:01:15,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 06:01:15,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 06:01:15,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 06:01:15,573 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2021-12-28 06:01:15,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 06:01:15,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 06:01:15,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 06:01:15,969 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 06:01:15,970 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 06:01:15,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-28 06:01:16,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b2141d4/c66f4963b868448cbd2561f6ec44c641/FLAG332a0486f [2021-12-28 06:01:16,604 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 06:01:16,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-28 06:01:16,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b2141d4/c66f4963b868448cbd2561f6ec44c641/FLAG332a0486f [2021-12-28 06:01:17,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b2141d4/c66f4963b868448cbd2561f6ec44c641 [2021-12-28 06:01:17,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 06:01:17,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 06:01:17,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 06:01:17,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 06:01:17,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 06:01:17,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a25836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17, skipping insertion in model container [2021-12-28 06:01:17,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 06:01:17,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 06:01:17,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-12-28 06:01:17,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:01:17,494 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 06:01:17,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-12-28 06:01:17,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:01:17,584 INFO L208 MainTranslator]: Completed translation [2021-12-28 06:01:17,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17 WrapperNode [2021-12-28 06:01:17,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 06:01:17,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 06:01:17,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 06:01:17,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 06:01:17,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,650 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-28 06:01:17,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 06:01:17,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 06:01:17,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 06:01:17,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 06:01:17,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 06:01:17,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 06:01:17,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 06:01:17,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 06:01:17,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (1/1) ... [2021-12-28 06:01:17,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:01:17,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:17,745 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-28 06:01:17,774 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-28 06:01:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 06:01:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 06:01:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-28 06:01:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-28 06:01:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 06:01:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 06:01:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 06:01:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 06:01:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 06:01:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 06:01:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 06:01:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 06:01:18,000 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 06:01:18,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 06:01:18,349 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 06:01:18,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 06:01:18,356 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-28 06:01:18,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:01:18 BoogieIcfgContainer [2021-12-28 06:01:18,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 06:01:18,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 06:01:18,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 06:01:18,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 06:01:18,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 06:01:17" (1/3) ... [2021-12-28 06:01:18,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207f1d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:01:18, skipping insertion in model container [2021-12-28 06:01:18,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:01:17" (2/3) ... [2021-12-28 06:01:18,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207f1d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:01:18, skipping insertion in model container [2021-12-28 06:01:18,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:01:18" (3/3) ... [2021-12-28 06:01:18,379 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-12-28 06:01:18,407 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 06:01:18,407 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-28 06:01:18,480 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 06:01:18,485 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-28 06:01:18,485 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-28 06:01:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 06:01:18,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:18,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 06:01:18,509 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:18,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-28 06:01:18,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:18,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046074307] [2021-12-28 06:01:18,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:18,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:18,714 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-28 06:01:18,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:18,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046074307] [2021-12-28 06:01:18,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046074307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:18,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:18,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:01:18,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714850445] [2021-12-28 06:01:18,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:18,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:01:18,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:01:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:01:18,752 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:01:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:18,862 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-28 06:01:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:01:18,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 06:01:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:18,871 INFO L225 Difference]: With dead ends: 90 [2021-12-28 06:01:18,871 INFO L226 Difference]: Without dead ends: 87 [2021-12-28 06:01:18,872 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-28 06:01:18,875 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:18,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-28 06:01:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-28 06:01:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-28 06:01:18,911 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-28 06:01:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:18,911 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-28 06:01:18,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:01:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-28 06:01:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 06:01:18,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:18,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 06:01:18,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 06:01:18,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-28 06:01:18,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677142947] [2021-12-28 06:01:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:18,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:18,998 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-28 06:01:18,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:18,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677142947] [2021-12-28 06:01:18,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677142947] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:19,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:19,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:01:19,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28183467] [2021-12-28 06:01:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:19,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:01:19,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:19,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:01:19,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:01:19,006 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:01:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:19,090 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-28 06:01:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:01:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 06:01:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:19,092 INFO L225 Difference]: With dead ends: 84 [2021-12-28 06:01:19,093 INFO L226 Difference]: Without dead ends: 84 [2021-12-28 06:01:19,094 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-28 06:01:19,095 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:19,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-28 06:01:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-28 06:01:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-28 06:01:19,108 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-28 06:01:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:19,109 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-28 06:01:19,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:01:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-28 06:01:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 06:01:19,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:19,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:19,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 06:01:19,110 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-28 06:01:19,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:19,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68539644] [2021-12-28 06:01:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:19,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,197 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-28 06:01:19,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:19,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68539644] [2021-12-28 06:01:19,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68539644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:19,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:19,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 06:01:19,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577649261] [2021-12-28 06:01:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:19,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:01:19,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:01:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:01:19,200 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 06:01:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:19,280 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-28 06:01:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:01:19,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-12-28 06:01:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:19,282 INFO L225 Difference]: With dead ends: 95 [2021-12-28 06:01:19,282 INFO L226 Difference]: Without dead ends: 95 [2021-12-28 06:01:19,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:01:19,284 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:19,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-28 06:01:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-28 06:01:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-28 06:01:19,292 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-28 06:01:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:19,292 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-28 06:01:19,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 06:01:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-28 06:01:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 06:01:19,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:19,293 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:19,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 06:01:19,294 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-28 06:01:19,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:19,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70768403] [2021-12-28 06:01:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:19,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:01:19,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70768403] [2021-12-28 06:01:19,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70768403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:19,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:19,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:01:19,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54768539] [2021-12-28 06:01:19,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:19,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:01:19,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:19,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:01:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:01:19,462 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:19,616 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-28 06:01:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:01:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-28 06:01:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:19,619 INFO L225 Difference]: With dead ends: 105 [2021-12-28 06:01:19,619 INFO L226 Difference]: Without dead ends: 105 [2021-12-28 06:01:19,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:19,621 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:19,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-28 06:01:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-28 06:01:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-28 06:01:19,628 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-28 06:01:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:19,628 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-28 06:01:19,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-28 06:01:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 06:01:19,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:19,630 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:19,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 06:01:19,630 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-28 06:01:19,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:19,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302296296] [2021-12-28 06:01:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:19,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:19,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302296296] [2021-12-28 06:01:19,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302296296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:19,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:19,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:01:19,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533881649] [2021-12-28 06:01:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:19,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:01:19,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:01:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:01:19,773 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:19,899 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-28 06:01:19,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:01:19,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-28 06:01:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:19,901 INFO L225 Difference]: With dead ends: 84 [2021-12-28 06:01:19,901 INFO L226 Difference]: Without dead ends: 84 [2021-12-28 06:01:19,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:19,902 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:19,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-28 06:01:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-28 06:01:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-28 06:01:19,907 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-28 06:01:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:19,908 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-28 06:01:19,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-28 06:01:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:01:19,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:19,909 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:19,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 06:01:19,909 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-28 06:01:19,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:19,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053462810] [2021-12-28 06:01:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:19,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:20,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:20,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053462810] [2021-12-28 06:01:20,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053462810] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:20,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960533739] [2021-12-28 06:01:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:20,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:20,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:20,064 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-28 06:01:20,066 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-28 06:01:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:20,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 06:01:20,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:20,240 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-28 06:01:20,464 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 06:01:20,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 06:01:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:01:20,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:20,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960533739] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:20,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:01:20,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-28 06:01:20,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575933084] [2021-12-28 06:01:20,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:20,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:01:20,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:20,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:01:20,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-28 06:01:20,549 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:01:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:20,709 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2021-12-28 06:01:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:01:20,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-12-28 06:01:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:20,710 INFO L225 Difference]: With dead ends: 110 [2021-12-28 06:01:20,710 INFO L226 Difference]: Without dead ends: 110 [2021-12-28 06:01:20,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-28 06:01:20,711 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:20,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2021-12-28 06:01:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-28 06:01:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2021-12-28 06:01:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-28 06:01:20,716 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2021-12-28 06:01:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:20,716 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-28 06:01:20,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:01:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-28 06:01:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:01:20,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:20,717 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:20,737 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-28 06:01:20,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 06:01:20,933 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-28 06:01:20,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:20,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784251492] [2021-12-28 06:01:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:20,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:21,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:21,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784251492] [2021-12-28 06:01:21,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784251492] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:21,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012228989] [2021-12-28 06:01:21,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:21,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:21,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:21,191 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-28 06:01:21,211 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-28 06:01:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:21,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 06:01:21,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:21,340 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-28 06:01:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:21,615 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 14 treesize of output 16 [2021-12-28 06:01:21,621 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:01:21,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:01:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:01:21,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:21,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012228989] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:21,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:01:21,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-28 06:01:21,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377636686] [2021-12-28 06:01:21,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:21,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-28 06:01:21,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 06:01:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-28 06:01:21,746 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 06:01:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:22,032 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-28 06:01:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:01:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2021-12-28 06:01:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:22,033 INFO L225 Difference]: With dead ends: 90 [2021-12-28 06:01:22,033 INFO L226 Difference]: Without dead ends: 90 [2021-12-28 06:01:22,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-12-28 06:01:22,034 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:22,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 2 Unchecked, 0.2s Time] [2021-12-28 06:01:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-28 06:01:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-12-28 06:01:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-28 06:01:22,038 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2021-12-28 06:01:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:22,038 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-28 06:01:22,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 06:01:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-28 06:01:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 06:01:22,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:22,039 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:22,120 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-28 06:01:22,247 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,SelfDestructingSolverStorable6 [2021-12-28 06:01:22,248 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-28 06:01:22,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:22,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870462891] [2021-12-28 06:01:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:22,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:22,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:22,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:22,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870462891] [2021-12-28 06:01:22,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870462891] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:22,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639120362] [2021-12-28 06:01:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:22,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:22,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:22,356 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-28 06:01:22,357 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-28 06:01:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:22,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 06:01:22,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:22,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:22,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639120362] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:22,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:22,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-28 06:01:22,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949645943] [2021-12-28 06:01:22,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:22,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:01:22,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:01:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:01:22,623 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:22,686 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-28 06:01:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:01:22,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-12-28 06:01:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:22,687 INFO L225 Difference]: With dead ends: 89 [2021-12-28 06:01:22,687 INFO L226 Difference]: Without dead ends: 89 [2021-12-28 06:01:22,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:22,688 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:22,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 436 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-28 06:01:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-12-28 06:01:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-28 06:01:22,692 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2021-12-28 06:01:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:22,692 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-28 06:01:22,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-28 06:01:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:01:22,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:22,693 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:22,713 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-28 06:01:22,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:22,911 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-28 06:01:22,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:22,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215650167] [2021-12-28 06:01:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:22,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 06:01:22,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:22,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215650167] [2021-12-28 06:01:22,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215650167] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:22,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652430188] [2021-12-28 06:01:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:22,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:22,976 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-28 06:01:22,977 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-28 06:01:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:23,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 06:01:23,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 06:01:23,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:23,129 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 06:01:23,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-28 06:01:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 06:01:23,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652430188] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:23,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:23,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2021-12-28 06:01:23,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363260410] [2021-12-28 06:01:23,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:23,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:01:23,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:23,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:01:23,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:01:23,163 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:01:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:23,241 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-12-28 06:01:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:01:23,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-12-28 06:01:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:23,242 INFO L225 Difference]: With dead ends: 113 [2021-12-28 06:01:23,242 INFO L226 Difference]: Without dead ends: 113 [2021-12-28 06:01:23,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:23,245 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:23,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-28 06:01:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-12-28 06:01:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2021-12-28 06:01:23,253 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2021-12-28 06:01:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:23,254 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2021-12-28 06:01:23,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:01:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2021-12-28 06:01:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:01:23,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:23,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:23,274 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-28 06:01:23,455 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-28 06:01:23,455 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-28 06:01:23,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:23,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182047939] [2021-12-28 06:01:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:23,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:23,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:23,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:23,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:23,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182047939] [2021-12-28 06:01:23,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182047939] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:23,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756993196] [2021-12-28 06:01:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:23,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:23,595 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-28 06:01:23,607 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-28 06:01:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:23,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 06:01:23,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:23,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:23,846 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:23,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2021-12-28 06:01:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:23,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756993196] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:23,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:23,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2021-12-28 06:01:23,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402263021] [2021-12-28 06:01:23,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:23,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-28 06:01:23,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:23,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-28 06:01:23,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:01:23,973 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 06:01:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:24,155 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-28 06:01:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 06:01:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2021-12-28 06:01:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:24,156 INFO L225 Difference]: With dead ends: 150 [2021-12-28 06:01:24,156 INFO L226 Difference]: Without dead ends: 150 [2021-12-28 06:01:24,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-12-28 06:01:24,157 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:24,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 752 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:01:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-28 06:01:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2021-12-28 06:01:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2021-12-28 06:01:24,160 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2021-12-28 06:01:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:24,160 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2021-12-28 06:01:24,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 06:01:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2021-12-28 06:01:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-28 06:01:24,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:24,161 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:24,181 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-28 06:01:24,367 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-28 06:01:24,368 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2021-12-28 06:01:24,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:24,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463433091] [2021-12-28 06:01:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:24,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:01:24,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:24,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463433091] [2021-12-28 06:01:24,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463433091] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:24,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:24,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:01:24,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447334060] [2021-12-28 06:01:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:24,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:01:24,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:01:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:24,438 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:24,568 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-28 06:01:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:01:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-28 06:01:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:24,569 INFO L225 Difference]: With dead ends: 111 [2021-12-28 06:01:24,569 INFO L226 Difference]: Without dead ends: 111 [2021-12-28 06:01:24,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:01:24,570 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 135 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:24,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 294 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-28 06:01:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-12-28 06:01:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-12-28 06:01:24,576 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2021-12-28 06:01:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:24,576 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-12-28 06:01:24,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-12-28 06:01:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-28 06:01:24,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:24,577 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:24,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 06:01:24,577 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2021-12-28 06:01:24,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:24,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315485125] [2021-12-28 06:01:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:24,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:24,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:24,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315485125] [2021-12-28 06:01:24,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315485125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:24,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:24,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:01:24,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252180845] [2021-12-28 06:01:24,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:24,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:01:24,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:01:24,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:24,700 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:24,820 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2021-12-28 06:01:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:01:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-28 06:01:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:24,821 INFO L225 Difference]: With dead ends: 89 [2021-12-28 06:01:24,821 INFO L226 Difference]: Without dead ends: 89 [2021-12-28 06:01:24,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:01:24,822 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 136 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:24,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 290 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-28 06:01:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-28 06:01:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-12-28 06:01:24,824 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2021-12-28 06:01:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:24,825 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-12-28 06:01:24,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-12-28 06:01:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 06:01:24,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:24,826 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:24,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 06:01:24,826 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:24,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:24,826 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2021-12-28 06:01:24,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:24,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559590758] [2021-12-28 06:01:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:24,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:01:24,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559590758] [2021-12-28 06:01:24,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559590758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:24,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:24,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 06:01:24,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857232627] [2021-12-28 06:01:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:24,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:01:24,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:01:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:01:24,919 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:25,161 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-28 06:01:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 06:01:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-12-28 06:01:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:25,162 INFO L225 Difference]: With dead ends: 158 [2021-12-28 06:01:25,162 INFO L226 Difference]: Without dead ends: 158 [2021-12-28 06:01:25,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:01:25,163 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 320 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:25,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 509 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:01:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-28 06:01:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2021-12-28 06:01:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-28 06:01:25,166 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2021-12-28 06:01:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:25,166 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-28 06:01:25,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-28 06:01:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 06:01:25,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:25,166 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:25,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 06:01:25,167 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2021-12-28 06:01:25,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:25,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666327556] [2021-12-28 06:01:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:25,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:25,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:25,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666327556] [2021-12-28 06:01:25,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666327556] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:25,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:25,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 06:01:25,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706762402] [2021-12-28 06:01:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:25,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:01:25,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:25,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:01:25,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:01:25,312 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:25,579 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2021-12-28 06:01:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 06:01:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-12-28 06:01:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:25,581 INFO L225 Difference]: With dead ends: 138 [2021-12-28 06:01:25,581 INFO L226 Difference]: Without dead ends: 138 [2021-12-28 06:01:25,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:01:25,582 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 331 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:25,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 515 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:01:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-28 06:01:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2021-12-28 06:01:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.515625) internal successors, (97), 87 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-28 06:01:25,585 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 35 [2021-12-28 06:01:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:25,586 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-28 06:01:25,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-28 06:01:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 06:01:25,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:25,587 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:25,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 06:01:25,587 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1296521997, now seen corresponding path program 1 times [2021-12-28 06:01:25,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:25,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694186127] [2021-12-28 06:01:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:25,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:25,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:25,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694186127] [2021-12-28 06:01:25,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694186127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:25,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:25,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:01:25,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223198749] [2021-12-28 06:01:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:25,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:01:25,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:01:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:01:25,695 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:25,755 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-12-28 06:01:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:01:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-12-28 06:01:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:25,756 INFO L225 Difference]: With dead ends: 121 [2021-12-28 06:01:25,756 INFO L226 Difference]: Without dead ends: 121 [2021-12-28 06:01:25,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:01:25,759 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 89 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:25,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 209 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-28 06:01:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2021-12-28 06:01:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5) internal successors, (99), 89 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2021-12-28 06:01:25,763 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 37 [2021-12-28 06:01:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:25,763 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2021-12-28 06:01:25,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2021-12-28 06:01:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 06:01:25,764 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:25,764 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:25,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 06:01:25,765 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2021-12-28 06:01:25,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:25,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266277930] [2021-12-28 06:01:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:25,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:25,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266277930] [2021-12-28 06:01:25,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266277930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:25,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:25,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:01:25,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870384164] [2021-12-28 06:01:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:25,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:01:25,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:01:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:01:25,824 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:25,887 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-28 06:01:25,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:01:25,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-12-28 06:01:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:25,889 INFO L225 Difference]: With dead ends: 170 [2021-12-28 06:01:25,889 INFO L226 Difference]: Without dead ends: 170 [2021-12-28 06:01:25,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:01:25,890 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 98 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:25,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 287 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-28 06:01:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 95. [2021-12-28 06:01:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:01:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2021-12-28 06:01:25,894 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 38 [2021-12-28 06:01:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:25,894 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2021-12-28 06:01:25,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2021-12-28 06:01:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-28 06:01:25,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:25,895 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:25,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 06:01:25,896 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2021-12-28 06:01:25,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:25,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479288063] [2021-12-28 06:01:25,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:25,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-28 06:01:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 06:01:25,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:25,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479288063] [2021-12-28 06:01:25,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479288063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:25,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972591498] [2021-12-28 06:01:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:25,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:25,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:25,971 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-28 06:01:26,000 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-28 06:01:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:26,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:01:26,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 06:01:26,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:01:26,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972591498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:26,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:01:26,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-28 06:01:26,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608047587] [2021-12-28 06:01:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:26,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:01:26,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:01:26,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:01:26,223 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:01:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:26,232 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-12-28 06:01:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:01:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2021-12-28 06:01:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:26,233 INFO L225 Difference]: With dead ends: 83 [2021-12-28 06:01:26,233 INFO L226 Difference]: Without dead ends: 83 [2021-12-28 06:01:26,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:01:26,234 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 63 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:26,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:01:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-28 06:01:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-28 06:01:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 79 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-12-28 06:01:26,237 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 41 [2021-12-28 06:01:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:26,238 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-12-28 06:01:26,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:01:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-12-28 06:01:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 06:01:26,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:26,239 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:26,276 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-28 06:01:26,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-28 06:01:26,453 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116999, now seen corresponding path program 1 times [2021-12-28 06:01:26,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506466690] [2021-12-28 06:01:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:26,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 06:01:26,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:26,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506466690] [2021-12-28 06:01:26,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506466690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:26,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:26,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 06:01:26,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075685530] [2021-12-28 06:01:26,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:26,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:01:26,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:01:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:01:26,576 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:26,794 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-12-28 06:01:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 06:01:26,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-28 06:01:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:26,796 INFO L225 Difference]: With dead ends: 108 [2021-12-28 06:01:26,796 INFO L226 Difference]: Without dead ends: 108 [2021-12-28 06:01:26,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:01:26,797 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 289 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:26,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 317 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-28 06:01:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2021-12-28 06:01:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2021-12-28 06:01:26,800 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 42 [2021-12-28 06:01:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:26,801 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2021-12-28 06:01:26,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2021-12-28 06:01:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 06:01:26,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:26,802 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:26,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 06:01:26,802 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116998, now seen corresponding path program 1 times [2021-12-28 06:01:26,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:26,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456303264] [2021-12-28 06:01:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:26,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:26,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:26,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456303264] [2021-12-28 06:01:26,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456303264] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892422961] [2021-12-28 06:01:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:26,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:26,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:26,908 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-28 06:01:26,981 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-28 06:01:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:27,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 06:01:27,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:27,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:27,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892422961] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:27,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:27,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-28 06:01:27,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294392809] [2021-12-28 06:01:27,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:27,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:01:27,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:27,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:01:27,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:01:27,339 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 06:01:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:27,406 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2021-12-28 06:01:27,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:01:27,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2021-12-28 06:01:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:27,407 INFO L225 Difference]: With dead ends: 108 [2021-12-28 06:01:27,407 INFO L226 Difference]: Without dead ends: 108 [2021-12-28 06:01:27,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:01:27,408 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 194 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:27,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 254 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-28 06:01:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-12-28 06:01:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.481012658227848) internal successors, (117), 98 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2021-12-28 06:01:27,412 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 42 [2021-12-28 06:01:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:27,412 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2021-12-28 06:01:27,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 06:01:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2021-12-28 06:01:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 06:01:27,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:27,413 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:27,455 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-28 06:01:27,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:27,636 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -960994977, now seen corresponding path program 1 times [2021-12-28 06:01:27,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095717613] [2021-12-28 06:01:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:27,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:27,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:28,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:28,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095717613] [2021-12-28 06:01:28,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095717613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:28,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663364615] [2021-12-28 06:01:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:28,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:28,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:28,032 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-28 06:01:28,075 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-28 06:01:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:28,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-28 06:01:28,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:28,284 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-28 06:01:28,430 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:01:28,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:01:28,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 06:01:28,503 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:01:28,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-28 06:01:28,543 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:01:28,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-28 06:01:28,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:28,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 26 [2021-12-28 06:01:28,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:28,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 26 [2021-12-28 06:01:28,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-28 06:01:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:28,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:33,615 INFO L353 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-28 06:01:33,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-28 06:01:33,618 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-28 06:01:33,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-28 06:01:33,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2200) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2021-12-28 06:01:33,639 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:33,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-28 06:01:33,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-28 06:01:33,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-28 06:01:33,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-12-28 06:01:33,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663364615] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:33,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:01:33,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 29 [2021-12-28 06:01:33,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866797755] [2021-12-28 06:01:33,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:33,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-28 06:01:33,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-28 06:01:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1164, Unknown=5, NotChecked=210, Total=1482 [2021-12-28 06:01:33,805 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:34,759 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2021-12-28 06:01:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-28 06:01:34,759 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-12-28 06:01:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:34,761 INFO L225 Difference]: With dead ends: 220 [2021-12-28 06:01:34,761 INFO L226 Difference]: Without dead ends: 220 [2021-12-28 06:01:34,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=262, Invalid=1907, Unknown=5, NotChecked=276, Total=2450 [2021-12-28 06:01:34,762 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 631 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:34,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 1155 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 06:01:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-28 06:01:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2021-12-28 06:01:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 108 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2021-12-28 06:01:34,767 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 43 [2021-12-28 06:01:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:34,767 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2021-12-28 06:01:34,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2021-12-28 06:01:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-28 06:01:34,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:34,768 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:34,798 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-28 06:01:34,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:34,983 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:34,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash -960994976, now seen corresponding path program 1 times [2021-12-28 06:01:34,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:34,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864553024] [2021-12-28 06:01:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:34,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:35,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:35,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864553024] [2021-12-28 06:01:35,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864553024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:35,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989355258] [2021-12-28 06:01:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:35,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:35,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:35,554 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-28 06:01:35,601 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-28 06:01:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:35,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-28 06:01:35,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:35,803 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-28 06:01:36,194 INFO L353 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2021-12-28 06:01:36,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2021-12-28 06:01:36,222 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:01:36,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:01:36,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 06:01:36,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 06:01:36,498 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:01:36,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-28 06:01:36,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 20 [2021-12-28 06:01:36,675 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:01:36,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-28 06:01:36,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 20 [2021-12-28 06:01:36,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:36,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 26 [2021-12-28 06:01:36,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:36,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-12-28 06:01:36,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:36,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-12-28 06:01:36,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:36,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 26 [2021-12-28 06:01:37,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-28 06:01:37,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-28 06:01:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:37,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:39,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2400) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_2400 Int)) (<= 0 (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2021-12-28 06:01:41,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_ArrVal_2400 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-28 06:01:43,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2400 Int)) (<= 0 (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2021-12-28 06:01:45,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2397 Int) (v_ArrVal_2399 Int) (v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2399) .cse1 v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2397) .cse1 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2399 Int) (v_ArrVal_2400 Int)) (<= 0 (+ (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2399) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8)))))) is different from false [2021-12-28 06:01:46,107 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:46,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 90 [2021-12-28 06:01:46,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:46,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 90 [2021-12-28 06:01:46,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 423 [2021-12-28 06:01:46,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1434 treesize of output 1414 [2021-12-28 06:01:46,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1324 treesize of output 1304 [2021-12-28 06:01:46,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1224 treesize of output 1206 [2021-12-28 06:01:46,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1037 treesize of output 1005 [2021-12-28 06:01:46,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 925 treesize of output 909 [2021-12-28 06:01:46,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 749 treesize of output 717 [2021-12-28 06:01:46,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 637 treesize of output 621 [2021-12-28 06:01:46,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 597 [2021-12-28 06:01:46,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:46,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 585 [2021-12-28 06:01:47,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989355258] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:47,290 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:01:47,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2021-12-28 06:01:47,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035797287] [2021-12-28 06:01:47,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:47,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-28 06:01:47,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:47,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-28 06:01:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2299, Unknown=6, NotChecked=396, Total=2862 [2021-12-28 06:01:47,292 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 06:01:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:48,836 INFO L93 Difference]: Finished difference Result 256 states and 314 transitions. [2021-12-28 06:01:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 06:01:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2021-12-28 06:01:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:48,838 INFO L225 Difference]: With dead ends: 256 [2021-12-28 06:01:48,838 INFO L226 Difference]: Without dead ends: 256 [2021-12-28 06:01:48,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=384, Invalid=3408, Unknown=6, NotChecked=492, Total=4290 [2021-12-28 06:01:48,840 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 916 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:48,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 1186 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 06:01:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-28 06:01:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 120. [2021-12-28 06:01:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 116 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2021-12-28 06:01:48,846 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 43 [2021-12-28 06:01:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:48,846 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2021-12-28 06:01:48,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 06:01:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2021-12-28 06:01:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 06:01:48,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:48,847 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:48,869 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-28 06:01:49,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:49,063 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1252304435, now seen corresponding path program 2 times [2021-12-28 06:01:49,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:49,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288568848] [2021-12-28 06:01:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:49,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:49,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:49,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288568848] [2021-12-28 06:01:49,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288568848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:49,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14003624] [2021-12-28 06:01:49,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:01:49,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:49,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:49,137 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-28 06:01:49,169 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-28 06:01:49,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 06:01:49,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:01:49,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:01:49,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:01:49,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:01:49,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14003624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:49,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:49,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-28 06:01:49,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21802868] [2021-12-28 06:01:49,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:49,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:01:49,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:49,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:01:49,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:49,637 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 06:01:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:49,748 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2021-12-28 06:01:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:01:49,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-28 06:01:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:49,751 INFO L225 Difference]: With dead ends: 112 [2021-12-28 06:01:49,751 INFO L226 Difference]: Without dead ends: 112 [2021-12-28 06:01:49,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:01:49,752 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 254 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:49,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 210 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-28 06:01:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2021-12-28 06:01:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 102 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2021-12-28 06:01:49,755 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 46 [2021-12-28 06:01:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:49,755 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2021-12-28 06:01:49,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 06:01:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2021-12-28 06:01:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-28 06:01:49,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:49,756 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:49,798 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-28 06:01:49,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-28 06:01:49,967 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676750, now seen corresponding path program 2 times [2021-12-28 06:01:49,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:49,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043164502] [2021-12-28 06:01:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:49,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:50,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043164502] [2021-12-28 06:01:50,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043164502] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081501827] [2021-12-28 06:01:50,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:01:50,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:50,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:50,068 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-28 06:01:50,095 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-28 06:01:50,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 06:01:50,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:01:50,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 06:01:50,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 06:01:50,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:01:50,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081501827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:50,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:01:50,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2021-12-28 06:01:50,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973485007] [2021-12-28 06:01:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:50,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 06:01:50,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 06:01:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-28 06:01:50,445 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:50,655 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2021-12-28 06:01:50,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 06:01:50,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2021-12-28 06:01:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:50,657 INFO L225 Difference]: With dead ends: 147 [2021-12-28 06:01:50,658 INFO L226 Difference]: Without dead ends: 147 [2021-12-28 06:01:50,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-28 06:01:50,658 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 426 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:50,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 276 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-28 06:01:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2021-12-28 06:01:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 102 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2021-12-28 06:01:50,661 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 47 [2021-12-28 06:01:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:50,661 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2021-12-28 06:01:50,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2021-12-28 06:01:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-28 06:01:50,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:50,662 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:50,680 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-28 06:01:50,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-28 06:01:50,875 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676805, now seen corresponding path program 1 times [2021-12-28 06:01:50,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:50,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610939445] [2021-12-28 06:01:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:50,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-28 06:01:50,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:50,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610939445] [2021-12-28 06:01:50,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610939445] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:50,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:01:50,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:01:50,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774214010] [2021-12-28 06:01:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:50,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:01:50,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:01:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:01:50,942 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:50,985 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-28 06:01:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:01:50,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2021-12-28 06:01:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:50,986 INFO L225 Difference]: With dead ends: 103 [2021-12-28 06:01:50,986 INFO L226 Difference]: Without dead ends: 103 [2021-12-28 06:01:50,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:01:50,986 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:50,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 262 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:01:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-28 06:01:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-12-28 06:01:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 97 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-12-28 06:01:50,989 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 47 [2021-12-28 06:01:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:50,989 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-12-28 06:01:50,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-12-28 06:01:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 06:01:50,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:50,990 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:50,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-28 06:01:50,990 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1716069023, now seen corresponding path program 1 times [2021-12-28 06:01:50,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:50,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243128241] [2021-12-28 06:01:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:50,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:51,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:51,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243128241] [2021-12-28 06:01:51,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243128241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:51,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420937114] [2021-12-28 06:01:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:51,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:51,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:51,051 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-28 06:01:51,052 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-28 06:01:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:51,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:01:51,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:51,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:01:51,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420937114] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:51,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:51,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-12-28 06:01:51,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482142697] [2021-12-28 06:01:51,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:51,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:01:51,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:01:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:51,407 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:51,474 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-28 06:01:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:01:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2021-12-28 06:01:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:51,475 INFO L225 Difference]: With dead ends: 99 [2021-12-28 06:01:51,475 INFO L226 Difference]: Without dead ends: 99 [2021-12-28 06:01:51,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:01:51,476 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 61 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:51,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 373 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:01:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-28 06:01:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-28 06:01:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 93 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-28 06:01:51,478 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2021-12-28 06:01:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:51,478 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-28 06:01:51,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-28 06:01:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 06:01:51,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:51,479 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:51,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-28 06:01:51,693 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,SelfDestructingSolverStorable24 [2021-12-28 06:01:51,693 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash -291844745, now seen corresponding path program 3 times [2021-12-28 06:01:51,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702312307] [2021-12-28 06:01:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:51,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:01:51,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:51,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702312307] [2021-12-28 06:01:51,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702312307] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:51,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51249319] [2021-12-28 06:01:51,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 06:01:51,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:51,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:51,797 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-28 06:01:51,840 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-28 06:01:52,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-28 06:01:52,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:01:52,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:01:52,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:01:52,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:01:52,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51249319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:01:52,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:01:52,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-28 06:01:52,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066090438] [2021-12-28 06:01:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:01:52,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:01:52,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:01:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:01:52,777 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:52,795 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2021-12-28 06:01:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:01:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2021-12-28 06:01:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:52,796 INFO L225 Difference]: With dead ends: 93 [2021-12-28 06:01:52,797 INFO L226 Difference]: Without dead ends: 93 [2021-12-28 06:01:52,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:01:52,797 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 137 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:52,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 145 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:01:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-28 06:01:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-28 06:01:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-28 06:01:52,799 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 51 [2021-12-28 06:01:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:52,800 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-28 06:01:52,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:01:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-28 06:01:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-28 06:01:52,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:52,800 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:52,829 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-28 06:01:53,001 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,SelfDestructingSolverStorable25 [2021-12-28 06:01:53,001 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:53,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:53,001 INFO L85 PathProgramCache]: Analyzing trace with hash 878531443, now seen corresponding path program 1 times [2021-12-28 06:01:53,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:53,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085454891] [2021-12-28 06:01:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:53,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:01:53,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085454891] [2021-12-28 06:01:53,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085454891] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307029832] [2021-12-28 06:01:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:53,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:53,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:53,594 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-28 06:01:53,595 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-28 06:01:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:53,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-28 06:01:53,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:53,836 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-28 06:01:54,021 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:01:54,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:01:54,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 06:01:54,163 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:01:54,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-28 06:01:54,266 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:01:54,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-28 06:01:54,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:54,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 21 [2021-12-28 06:01:54,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:54,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 21 [2021-12-28 06:01:54,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-28 06:01:54,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-28 06:01:54,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-28 06:01:54,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-28 06:01:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:01:54,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:55,149 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-28 06:01:55,172 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-28 06:01:55,180 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-28 06:01:55,195 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-28 06:01:55,219 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:55,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-28 06:01:55,226 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:55,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2021-12-28 06:01:55,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-28 06:01:55,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:55,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-28 06:01:55,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:01:55,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2021-12-28 06:01:55,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-28 06:01:55,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3475) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-28 06:01:55,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3475) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-28 06:01:55,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3474) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3475) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-28 06:01:55,524 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:01:55,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-28 06:01:55,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-28 06:01:55,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:01:55,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2021-12-28 06:01:55,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2021-12-28 06:01:55,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-28 06:01:55,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-28 06:01:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-28 06:01:55,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307029832] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:55,975 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:55,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2021-12-28 06:01:55,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825500173] [2021-12-28 06:01:55,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:55,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-28 06:01:55,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-28 06:01:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4316, Unknown=7, NotChecked=966, Total=5550 [2021-12-28 06:01:55,977 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-28 06:01:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:57,429 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-12-28 06:01:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-28 06:01:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2021-12-28 06:01:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:57,431 INFO L225 Difference]: With dead ends: 91 [2021-12-28 06:01:57,431 INFO L226 Difference]: Without dead ends: 91 [2021-12-28 06:01:57,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1799 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=508, Invalid=6319, Unknown=7, NotChecked=1176, Total=8010 [2021-12-28 06:01:57,433 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 263 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:57,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 1932 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1392 Invalid, 0 Unknown, 748 Unchecked, 0.6s Time] [2021-12-28 06:01:57,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-28 06:01:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-28 06:01:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-12-28 06:01:57,435 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 54 [2021-12-28 06:01:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:57,435 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-12-28 06:01:57,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-28 06:01:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-12-28 06:01:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 06:01:57,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:57,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:57,456 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-28 06:01:57,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:57,654 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1199894254, now seen corresponding path program 1 times [2021-12-28 06:01:57,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:57,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968624492] [2021-12-28 06:01:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:57,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:01:57,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:57,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968624492] [2021-12-28 06:01:57,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968624492] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:57,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898737053] [2021-12-28 06:01:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:57,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:57,836 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-28 06:01:57,838 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-28 06:01:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:58,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-28 06:01:58,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 06:01:58,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:01:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 06:01:58,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898737053] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:01:58,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:01:58,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2021-12-28 06:01:58,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099188959] [2021-12-28 06:01:58,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:01:58,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-28 06:01:58,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:01:58,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-28 06:01:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-12-28 06:01:58,690 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 06:01:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:01:58,986 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-28 06:01:58,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 06:01:58,987 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2021-12-28 06:01:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:01:58,987 INFO L225 Difference]: With dead ends: 125 [2021-12-28 06:01:58,987 INFO L226 Difference]: Without dead ends: 125 [2021-12-28 06:01:58,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2021-12-28 06:01:58,988 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 770 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:01:58,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 614 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:01:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-28 06:01:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2021-12-28 06:01:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:01:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-28 06:01:58,990 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2021-12-28 06:01:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:01:58,990 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-28 06:01:58,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-28 06:01:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-28 06:01:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-28 06:01:58,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:01:58,991 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:01:59,011 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-28 06:01:59,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-28 06:01:59,205 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:01:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:01:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash 963119259, now seen corresponding path program 1 times [2021-12-28 06:01:59,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:01:59,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039144481] [2021-12-28 06:01:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:59,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:01:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:01:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:01:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:01:59,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:01:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039144481] [2021-12-28 06:01:59,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039144481] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:01:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94431538] [2021-12-28 06:01:59,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:01:59,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:01:59,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:01:59,664 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 06:01:59,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-28 06:01:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:01:59,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-28 06:01:59,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:01:59,910 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-28 06:02:00,019 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:00,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:00,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 06:02:00,087 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:00,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-28 06:02:00,116 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:00,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-28 06:02:00,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:00,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 21 [2021-12-28 06:02:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:00,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 21 [2021-12-28 06:02:00,384 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:00,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-28 06:02:00,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-28 06:02:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:02:00,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:00,553 INFO L353 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-28 06:02:00,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-28 06:02:00,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) is different from false [2021-12-28 06:02:00,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-28 06:02:00,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2021-12-28 06:02:00,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2021-12-28 06:02:00,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3876)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-28 06:02:00,597 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-28 06:02:00,610 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-28 06:02:00,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-28 06:02:00,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-28 06:02:00,655 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3872))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-28 06:02:00,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3872))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2)))))) is different from false [2021-12-28 06:02:00,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3871 (Array Int Int)) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3871) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3872))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2)))))) is different from false [2021-12-28 06:02:00,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:00,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 86 [2021-12-28 06:02:00,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 476 [2021-12-28 06:02:00,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:00,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:00,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2021-12-28 06:02:00,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:00,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:00,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 202 [2021-12-28 06:02:00,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:00,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:00,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2021-12-28 06:02:00,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2021-12-28 06:02:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2021-12-28 06:02:01,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94431538] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:01,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:01,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 57 [2021-12-28 06:02:01,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279631127] [2021-12-28 06:02:01,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:01,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-28 06:02:01,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:01,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-28 06:02:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1954, Unknown=12, NotChecked=1188, Total=3306 [2021-12-28 06:02:01,377 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 58 states, 57 states have (on average 2.263157894736842) internal successors, (129), 51 states have internal predecessors, (129), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 06:02:01,765 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= .cse3 1) (not (= .cse3 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-28 06:02:01,767 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select |c_#valid| .cse2) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0))) is different from false [2021-12-28 06:02:01,769 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)))) is different from false [2021-12-28 06:02:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:02,340 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-12-28 06:02:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 06:02:02,341 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.263157894736842) internal successors, (129), 51 states have internal predecessors, (129), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2021-12-28 06:02:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:02,341 INFO L225 Difference]: With dead ends: 150 [2021-12-28 06:02:02,341 INFO L226 Difference]: Without dead ends: 150 [2021-12-28 06:02:02,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 86 SyntacticMatches, 10 SemanticMatches, 70 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=2976, Unknown=15, NotChecked=1860, Total=5112 [2021-12-28 06:02:02,343 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 291 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1845 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:02,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 1335 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1117 Invalid, 0 Unknown, 1845 Unchecked, 0.4s Time] [2021-12-28 06:02:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-28 06:02:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 95. [2021-12-28 06:02:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-28 06:02:02,345 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 60 [2021-12-28 06:02:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:02,346 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-28 06:02:02,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.263157894736842) internal successors, (129), 51 states have internal predecessors, (129), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 06:02:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-28 06:02:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-28 06:02:02,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:02,346 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:02,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-28 06:02:02,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-28 06:02:02,556 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 963119260, now seen corresponding path program 1 times [2021-12-28 06:02:02,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018589528] [2021-12-28 06:02:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:02,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 06:02:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 06:02:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:02:03,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:03,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018589528] [2021-12-28 06:02:03,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018589528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:03,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675298600] [2021-12-28 06:02:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:03,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:03,234 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 06:02:03,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-28 06:02:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:03,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-28 06:02:03,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:03,491 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-28 06:02:03,773 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:03,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:03,792 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2021-12-28 06:02:03,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-28 06:02:04,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:04,002 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 510245 column 46: unknown constant v_#length_BEFORE_CALL_6 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-28 06:02:04,005 INFO L158 Benchmark]: Toolchain (without parser) took 46971.03ms. Allocated memory was 50.3MB in the beginning and 188.7MB in the end (delta: 138.4MB). Free memory was 25.4MB in the beginning and 143.0MB in the end (delta: -117.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2021-12-28 06:02:04,005 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 06:02:04,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.34ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 25.2MB in the beginning and 35.9MB in the end (delta: -10.7MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2021-12-28 06:02:04,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.60ms. Allocated memory is still 60.8MB. Free memory was 35.9MB in the beginning and 33.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 06:02:04,006 INFO L158 Benchmark]: Boogie Preprocessor took 47.55ms. Allocated memory is still 60.8MB. Free memory was 33.7MB in the beginning and 32.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 06:02:04,006 INFO L158 Benchmark]: RCFGBuilder took 671.73ms. Allocated memory is still 60.8MB. Free memory was 32.0MB in the beginning and 29.4MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 06:02:04,006 INFO L158 Benchmark]: TraceAbstraction took 45632.27ms. Allocated memory was 60.8MB in the beginning and 188.7MB in the end (delta: 127.9MB). Free memory was 29.0MB in the beginning and 143.0MB in the end (delta: -114.0MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2021-12-28 06:02:04,007 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.40ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.34ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 25.2MB in the beginning and 35.9MB in the end (delta: -10.7MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.60ms. Allocated memory is still 60.8MB. Free memory was 35.9MB in the beginning and 33.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.55ms. Allocated memory is still 60.8MB. Free memory was 33.7MB in the beginning and 32.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 671.73ms. Allocated memory is still 60.8MB. Free memory was 32.0MB in the beginning and 29.4MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 45632.27ms. Allocated memory was 60.8MB in the beginning and 188.7MB in the end (delta: 127.9MB). Free memory was 29.0MB in the beginning and 143.0MB in the end (delta: -114.0MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 510245 column 46: unknown constant v_#length_BEFORE_CALL_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 510245 column 46: unknown constant v_#length_BEFORE_CALL_6: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-28 06:02:04,020 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 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-simple/dll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 06:02:05,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 06:02:05,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 06:02:05,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 06:02:05,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 06:02:05,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 06:02:05,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 06:02:05,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 06:02:05,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 06:02:05,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 06:02:05,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 06:02:05,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 06:02:05,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 06:02:05,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 06:02:05,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 06:02:05,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 06:02:05,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 06:02:05,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 06:02:05,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 06:02:05,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 06:02:05,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 06:02:05,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 06:02:05,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 06:02:05,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 06:02:05,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 06:02:05,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 06:02:05,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 06:02:05,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 06:02:05,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 06:02:05,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 06:02:05,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 06:02:05,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 06:02:05,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 06:02:05,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 06:02:05,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 06:02:05,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 06:02:05,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 06:02:05,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 06:02:05,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 06:02:05,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 06:02:05,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 06:02:05,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-28 06:02:05,691 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 06:02:05,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 06:02:05,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 06:02:05,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 06:02:05,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 06:02:05,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 06:02:05,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 06:02:05,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 06:02:05,694 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 06:02:05,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 06:02:05,695 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 06:02:05,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 06:02:05,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 06:02:05,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 06:02:05,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 06:02:05,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 06:02:05,696 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 06:02:05,696 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 06:02:05,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 06:02:05,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 06:02:05,697 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 06:02:05,697 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 06:02:05,697 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 06:02:05,697 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 06:02:05,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 06:02:05,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 06:02:05,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 06:02:05,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:05,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 06:02:05,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 06:02:05,698 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 06:02:05,699 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 06:02:05,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 06:02:05,699 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2021-12-28 06:02:05,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 06:02:06,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 06:02:06,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 06:02:06,019 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 06:02:06,020 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 06:02:06,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-28 06:02:06,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a37e224a/0bf3083f69f642cda3c79b39ecbe130b/FLAGb561e15f4 [2021-12-28 06:02:06,480 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 06:02:06,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-28 06:02:06,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a37e224a/0bf3083f69f642cda3c79b39ecbe130b/FLAGb561e15f4 [2021-12-28 06:02:06,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a37e224a/0bf3083f69f642cda3c79b39ecbe130b [2021-12-28 06:02:06,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 06:02:06,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 06:02:06,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:06,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 06:02:06,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 06:02:06,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d942376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06, skipping insertion in model container [2021-12-28 06:02:06,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 06:02:06,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 06:02:06,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-12-28 06:02:06,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:06,821 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 06:02:06,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i[24538,24551] [2021-12-28 06:02:06,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:06,901 INFO L208 MainTranslator]: Completed translation [2021-12-28 06:02:06,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06 WrapperNode [2021-12-28 06:02:06,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:06,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:06,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 06:02:06,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 06:02:06,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,940 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-28 06:02:06,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:06,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 06:02:06,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 06:02:06,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 06:02:06,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 06:02:06,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 06:02:06,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 06:02:06,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 06:02:06,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (1/1) ... [2021-12-28 06:02:06,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:06,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:06,990 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-28 06:02:07,009 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-28 06:02:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-28 06:02:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-28 06:02:07,026 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-28 06:02:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 06:02:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 06:02:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 06:02:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 06:02:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 06:02:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-28 06:02:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 06:02:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 06:02:07,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 06:02:07,122 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 06:02:07,136 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 06:02:07,490 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 06:02:07,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 06:02:07,497 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-28 06:02:07,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:07 BoogieIcfgContainer [2021-12-28 06:02:07,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 06:02:07,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 06:02:07,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 06:02:07,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 06:02:07,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 06:02:06" (1/3) ... [2021-12-28 06:02:07,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42345fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:07, skipping insertion in model container [2021-12-28 06:02:07,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:06" (2/3) ... [2021-12-28 06:02:07,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42345fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:07, skipping insertion in model container [2021-12-28 06:02:07,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:07" (3/3) ... [2021-12-28 06:02:07,509 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-12-28 06:02:07,516 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 06:02:07,516 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-28 06:02:07,551 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 06:02:07,557 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-28 06:02:07,557 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-28 06:02:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 06:02:07,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:07,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 06:02:07,572 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-28 06:02:07,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674318129] [2021-12-28 06:02:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:07,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:07,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:07,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-28 06:02:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:07,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 06:02:07,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:07,712 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-28 06:02:07,722 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-28 06:02:07,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:07,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:07,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674318129] [2021-12-28 06:02:07,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674318129] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:07,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:07,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:07,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591296748] [2021-12-28 06:02:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:07,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:07,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:07,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:07,754 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:07,881 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-28 06:02:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:07,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 06:02:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:07,892 INFO L225 Difference]: With dead ends: 90 [2021-12-28 06:02:07,892 INFO L226 Difference]: Without dead ends: 87 [2021-12-28 06:02:07,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 06:02:07,897 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:07,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-28 06:02:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-28 06:02:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-28 06:02:07,932 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-28 06:02:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:07,933 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-28 06:02:07,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-28 06:02:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 06:02:07,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:07,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 06:02:07,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:08,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:08,152 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-28 06:02:08,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952267048] [2021-12-28 06:02:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:08,154 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:08,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:08,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-28 06:02:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:08,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 06:02:08,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:08,215 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-28 06:02:08,229 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-28 06:02:08,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:08,230 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:08,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952267048] [2021-12-28 06:02:08,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952267048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:08,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:08,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:08,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132233023] [2021-12-28 06:02:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:08,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:08,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:08,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:08,232 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:08,314 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-28 06:02:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 06:02:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:08,316 INFO L225 Difference]: With dead ends: 84 [2021-12-28 06:02:08,316 INFO L226 Difference]: Without dead ends: 84 [2021-12-28 06:02:08,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 06:02:08,317 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:08,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-28 06:02:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-28 06:02:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-28 06:02:08,321 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-28 06:02:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:08,322 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-28 06:02:08,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-28 06:02:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 06:02:08,322 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:08,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:08,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:08,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:08,529 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-28 06:02:08,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:08,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468992418] [2021-12-28 06:02:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:08,530 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:08,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:08,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:08,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-28 06:02:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:08,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 06:02:08,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:08,654 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-28 06:02:08,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:08,654 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:08,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468992418] [2021-12-28 06:02:08,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468992418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:08,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:08,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:08,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37067372] [2021-12-28 06:02:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:08,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:08,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:08,659 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 06:02:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:08,680 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-28 06:02:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-12-28 06:02:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:08,683 INFO L225 Difference]: With dead ends: 95 [2021-12-28 06:02:08,683 INFO L226 Difference]: Without dead ends: 95 [2021-12-28 06:02:08,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-28 06:02:08,685 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:08,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 177 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-28 06:02:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-28 06:02:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-28 06:02:08,694 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-28 06:02:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:08,695 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-28 06:02:08,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 06:02:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-28 06:02:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 06:02:08,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:08,696 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:08,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-28 06:02:08,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:08,904 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:08,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-28 06:02:08,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:08,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626417618] [2021-12-28 06:02:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:08,906 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:08,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:08,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-28 06:02:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:09,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:02:09,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:09,050 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-28 06:02:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:09,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:09,099 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:09,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626417618] [2021-12-28 06:02:09,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626417618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:09,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:09,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:02:09,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538088747] [2021-12-28 06:02:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:09,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:02:09,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:09,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:02:09,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:09,104 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:02:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:09,358 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-28 06:02:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-28 06:02:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:09,361 INFO L225 Difference]: With dead ends: 105 [2021-12-28 06:02:09,363 INFO L226 Difference]: Without dead ends: 105 [2021-12-28 06:02:09,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:09,363 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:09,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 243 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:02:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-28 06:02:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-28 06:02:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-28 06:02:09,374 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-28 06:02:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:09,374 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-28 06:02:09,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:02:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-28 06:02:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 06:02:09,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:09,375 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:09,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:09,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:09,575 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-28 06:02:09,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094501607] [2021-12-28 06:02:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:09,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:09,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:09,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-28 06:02:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:09,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 06:02:09,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:09,708 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-28 06:02:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:09,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:09,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:09,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094501607] [2021-12-28 06:02:09,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094501607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:09,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:09,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:02:09,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642881328] [2021-12-28 06:02:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:09,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:02:09,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:09,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:02:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:09,805 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:02:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:10,037 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-28 06:02:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-28 06:02:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:10,039 INFO L225 Difference]: With dead ends: 84 [2021-12-28 06:02:10,039 INFO L226 Difference]: Without dead ends: 84 [2021-12-28 06:02:10,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:10,039 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 77 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:10,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 252 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:02:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-28 06:02:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-28 06:02:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-28 06:02:10,043 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-28 06:02:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:10,044 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-28 06:02:10,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 06:02:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-28 06:02:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:10,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:10,045 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:10,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-28 06:02:10,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:10,247 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-28 06:02:10,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:10,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706783733] [2021-12-28 06:02:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:10,248 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:10,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:10,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:10,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-28 06:02:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:10,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 06:02:10,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:10,371 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-28 06:02:10,557 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 06:02:10,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2021-12-28 06:02:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:10,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:10,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:10,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706783733] [2021-12-28 06:02:10,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706783733] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:10,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:02:10,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-12-28 06:02:10,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110598585] [2021-12-28 06:02:10,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:10,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:02:10,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:02:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:02:10,804 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:02:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:11,058 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-12-28 06:02:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:02:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-12-28 06:02:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:11,059 INFO L225 Difference]: With dead ends: 118 [2021-12-28 06:02:11,060 INFO L226 Difference]: Without dead ends: 118 [2021-12-28 06:02:11,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-28 06:02:11,060 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:11,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 281 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2021-12-28 06:02:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-28 06:02:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2021-12-28 06:02:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:02:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2021-12-28 06:02:11,065 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 26 [2021-12-28 06:02:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:11,066 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2021-12-28 06:02:11,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 06:02:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2021-12-28 06:02:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:11,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:11,067 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:11,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:11,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:11,276 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-28 06:02:11,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:11,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529540239] [2021-12-28 06:02:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:11,277 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:11,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:11,278 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:11,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-28 06:02:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:11,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-28 06:02:11,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:11,412 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-28 06:02:11,416 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-28 06:02:11,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:11,671 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-28 06:02:11,679 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:11,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2021-12-28 06:02:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:11,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:11,964 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:11,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529540239] [2021-12-28 06:02:11,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529540239] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:11,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1348635260] [2021-12-28 06:02:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:11,964 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-28 06:02:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-28 06:02:11,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-28 06:02:11,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-28 06:02:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:12,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-28 06:02:12,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:12,169 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-28 06:02:12,174 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-28 06:02:14,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:14,393 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-28 06:02:14,401 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:14,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2021-12-28 06:02:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:14,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:16,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1348635260] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:16,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:02:16,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-28 06:02:16,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112592208] [2021-12-28 06:02:16,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:16,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:02:16,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:02:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:16,620 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:16,950 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2021-12-28 06:02:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:02:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-12-28 06:02:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:16,951 INFO L225 Difference]: With dead ends: 98 [2021-12-28 06:02:16,951 INFO L226 Difference]: Without dead ends: 98 [2021-12-28 06:02:16,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:16,952 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:16,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 367 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 44 Unchecked, 0.3s Time] [2021-12-28 06:02:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-28 06:02:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2021-12-28 06:02:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.523076923076923) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:02:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-12-28 06:02:16,955 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 26 [2021-12-28 06:02:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:16,956 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-12-28 06:02:16,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-12-28 06:02:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 06:02:16,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:16,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:16,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:17,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:17,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:17,360 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-28 06:02:17,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:17,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745477158] [2021-12-28 06:02:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:17,362 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:17,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:17,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:17,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-28 06:02:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:17,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:17,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:17,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:17,611 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745477158] [2021-12-28 06:02:17,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745477158] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:17,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:02:17,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-28 06:02:17,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4732214] [2021-12-28 06:02:17,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:17,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:02:17,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:02:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:17,613 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:17,753 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-28 06:02:17,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:17,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-12-28 06:02:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:17,754 INFO L225 Difference]: With dead ends: 97 [2021-12-28 06:02:17,754 INFO L226 Difference]: Without dead ends: 97 [2021-12-28 06:02:17,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:17,755 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:17,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-28 06:02:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2021-12-28 06:02:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:02:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-12-28 06:02:17,758 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 28 [2021-12-28 06:02:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:17,758 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-12-28 06:02:17,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-12-28 06:02:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:02:17,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:17,759 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:17,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:17,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:17,963 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-28 06:02:17,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:17,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254997330] [2021-12-28 06:02:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:17,964 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:17,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:17,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-28 06:02:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:18,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 06:02:18,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 06:02:18,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:18,121 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 06:02:18,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-28 06:02:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 06:02:18,150 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254997330] [2021-12-28 06:02:18,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254997330] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:18,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:02:18,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-12-28 06:02:18,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779436034] [2021-12-28 06:02:18,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:18,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:18,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:18,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:18,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:02:18,153 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:18,323 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-12-28 06:02:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:18,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-12-28 06:02:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:18,325 INFO L225 Difference]: With dead ends: 121 [2021-12-28 06:02:18,325 INFO L226 Difference]: Without dead ends: 121 [2021-12-28 06:02:18,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:18,325 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 65 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:18,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 154 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:02:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-28 06:02:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2021-12-28 06:02:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 93 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 06:02:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2021-12-28 06:02:18,328 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 29 [2021-12-28 06:02:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:18,329 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-12-28 06:02:18,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 06:02:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2021-12-28 06:02:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:02:18,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:18,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:18,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:18,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 06:02:18,531 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-28 06:02:18,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 06:02:18,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578075018] [2021-12-28 06:02:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:18,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 06:02:18,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 06:02:18,533 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 06:02:18,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-28 06:02:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:18,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 06:02:18,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:18,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:18,834 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:18,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2021-12-28 06:02:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:19,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 06:02:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578075018] [2021-12-28 06:02:19,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578075018] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:19,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 06:02:19,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-12-28 06:02:19,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52579978] [2021-12-28 06:02:19,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:19,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 06:02:19,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 06:02:19,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 06:02:19,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-28 06:02:19,248 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)