./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:45:41,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:45:41,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:45:41,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:45:41,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:45:41,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:45:41,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:45:41,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:45:41,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:45:41,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:45:41,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:45:41,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:45:41,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:45:41,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:45:41,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:45:41,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:45:41,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:45:41,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:45:41,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:45:41,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:45:41,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:45:41,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:45:41,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:45:41,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:45:41,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:45:41,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:45:41,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:45:41,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:45:41,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:45:41,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:45:41,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:45:41,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:45:41,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:45:41,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:45:41,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:45:41,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:45:41,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:45:41,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:45:41,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:45:41,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:45:41,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:45:41,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 16:45:41,381 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:45:41,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:45:41,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:45:41,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:45:41,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:45:41,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:45:41,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:45:41,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:45:41,384 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:45:41,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:45:41,385 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:45:41,386 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:45:41,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:45:41,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:45:41,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:45:41,386 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:45:41,386 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:45:41,386 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:45:41,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:45:41,387 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:45:41,387 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:45:41,387 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:45:41,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:45:41,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:45:41,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:45:41,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:45:41,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:45:41,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:45:41,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:45:41,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:45:41,390 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:45:41,390 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2021-12-22 16:45:41,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:45:41,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:45:41,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:45:41,678 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:45:41,679 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:45:41,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-22 16:45:41,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b1d6482/bee5e7d6bd64476996724547b7cd3c3e/FLAG102a26213 [2021-12-22 16:45:42,254 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:45:42,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-22 16:45:42,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b1d6482/bee5e7d6bd64476996724547b7cd3c3e/FLAG102a26213 [2021-12-22 16:45:42,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b1d6482/bee5e7d6bd64476996724547b7cd3c3e [2021-12-22 16:45:42,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:45:42,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:45:42,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:45:42,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:45:42,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:45:42,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:45:42" (1/1) ... [2021-12-22 16:45:42,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797dc308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:42, skipping insertion in model container [2021-12-22 16:45:42,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:45:42" (1/1) ... [2021-12-22 16:45:42,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:45:42,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:45:42,957 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/sll2n_update_all_reverse.i[24236,24249] [2021-12-22 16:45:42,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:45:42,970 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:45:43,023 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/sll2n_update_all_reverse.i[24236,24249] [2021-12-22 16:45:43,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:45:43,046 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:45:43,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43 WrapperNode [2021-12-22 16:45:43,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:45:43,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:45:43,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:45:43,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:45:43,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,103 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2021-12-22 16:45:43,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:45:43,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:45:43,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:45:43,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:45:43,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:45:43,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:45:43,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:45:43,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:45:43,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (1/1) ... [2021-12-22 16:45:43,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:45:43,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:43,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:45:43,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 16:45:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:45:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:45:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:45:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:45:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:45:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:45:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:45:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:45:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:45:43,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:45:43,403 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:45:43,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:45:43,571 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:45:43,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:45:43,575 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-22 16:45:43,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:45:43 BoogieIcfgContainer [2021-12-22 16:45:43,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:45:43,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:45:43,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:45:43,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:45:43,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:45:42" (1/3) ... [2021-12-22 16:45:43,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40835582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:45:43, skipping insertion in model container [2021-12-22 16:45:43,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:45:43" (2/3) ... [2021-12-22 16:45:43,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40835582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:45:43, skipping insertion in model container [2021-12-22 16:45:43,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:45:43" (3/3) ... [2021-12-22 16:45:43,583 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-12-22 16:45:43,586 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:45:43,586 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-22 16:45:43,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:45:43,617 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:45:43,617 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-22 16:45:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-22 16:45:43,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:43,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-22 16:45:43,631 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-12-22 16:45:43,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:43,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851159122] [2021-12-22 16:45:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:43,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:43,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:43,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851159122] [2021-12-22 16:45:43,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851159122] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:43,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:43,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:45:43,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634303418] [2021-12-22 16:45:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:43,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:45:43,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:45:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:45:43,764 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:43,821 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-12-22 16:45:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:45:43,823 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-22 16:45:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:43,828 INFO L225 Difference]: With dead ends: 109 [2021-12-22 16:45:43,828 INFO L226 Difference]: Without dead ends: 104 [2021-12-22 16:45:43,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:45:43,834 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:43,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-22 16:45:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-22 16:45:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-22 16:45:43,865 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2021-12-22 16:45:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:43,865 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-22 16:45:43,865 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-22 16:45:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-22 16:45:43,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:43,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-22 16:45:43,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:45:43,867 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-12-22 16:45:43,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:43,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042060980] [2021-12-22 16:45:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:43,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:43,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:43,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042060980] [2021-12-22 16:45:43,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042060980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:43,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:43,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:45:43,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860571597] [2021-12-22 16:45:43,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:43,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:45:43,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:43,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:45:43,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:45:43,942 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:44,021 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-22 16:45:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:45:44,023 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-22 16:45:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:44,024 INFO L225 Difference]: With dead ends: 102 [2021-12-22 16:45:44,025 INFO L226 Difference]: Without dead ends: 102 [2021-12-22 16:45:44,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:45:44,027 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:44,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-22 16:45:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2021-12-22 16:45:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-22 16:45:44,035 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2021-12-22 16:45:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:44,035 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-22 16:45:44,036 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-22 16:45:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:45:44,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:44,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:45:44,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:45:44,039 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2021-12-22 16:45:44,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:44,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105902001] [2021-12-22 16:45:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:44,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:44,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:44,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105902001] [2021-12-22 16:45:44,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105902001] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:44,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:44,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:45:44,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996448067] [2021-12-22 16:45:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:44,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:45:44,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:44,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:45:44,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:45:44,081 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:44,094 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-22 16:45:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:45:44,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 16:45:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:44,095 INFO L225 Difference]: With dead ends: 68 [2021-12-22 16:45:44,096 INFO L226 Difference]: Without dead ends: 68 [2021-12-22 16:45:44,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:45:44,097 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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-22 16:45:44,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-22 16:45:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2021-12-22 16:45:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-12-22 16:45:44,106 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2021-12-22 16:45:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:44,107 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-12-22 16:45:44,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-12-22 16:45:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 16:45:44,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:44,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:45:44,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:45:44,109 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:44,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-12-22 16:45:44,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:44,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205463542] [2021-12-22 16:45:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:44,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:44,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:44,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205463542] [2021-12-22 16:45:44,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205463542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:44,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:44,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:45:44,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623964090] [2021-12-22 16:45:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:44,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:45:44,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:45:44,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:45:44,184 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:44,275 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-22 16:45:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:45:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-22 16:45:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:44,276 INFO L225 Difference]: With dead ends: 76 [2021-12-22 16:45:44,276 INFO L226 Difference]: Without dead ends: 76 [2021-12-22 16:45:44,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:45:44,283 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:44,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:45:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-22 16:45:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-22 16:45:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-22 16:45:44,294 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2021-12-22 16:45:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:44,294 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-22 16:45:44,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-22 16:45:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 16:45:44,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:44,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:45:44,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:45:44,296 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-12-22 16:45:44,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:44,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000271434] [2021-12-22 16:45:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:44,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:44,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:44,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000271434] [2021-12-22 16:45:44,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000271434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:44,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:44,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:45:44,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059108805] [2021-12-22 16:45:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:44,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:45:44,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:45:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:45:44,377 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:44,436 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-22 16:45:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:45:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-22 16:45:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:44,438 INFO L225 Difference]: With dead ends: 61 [2021-12-22 16:45:44,439 INFO L226 Difference]: Without dead ends: 61 [2021-12-22 16:45:44,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:45:44,442 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:44,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-22 16:45:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-22 16:45:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-12-22 16:45:44,464 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-12-22 16:45:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:44,464 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-12-22 16:45:44,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-12-22 16:45:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 16:45:44,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:44,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:45:44,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:45:44,465 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2021-12-22 16:45:44,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:44,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737701515] [2021-12-22 16:45:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:44,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:44,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:44,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737701515] [2021-12-22 16:45:44,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737701515] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:44,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061272384] [2021-12-22 16:45:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:44,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:44,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:44,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:44,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 16:45:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:44,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 16:45:44,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:44,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:45:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:44,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061272384] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:45:44,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:45:44,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-22 16:45:44,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445684963] [2021-12-22 16:45:44,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:45:44,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:45:44,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:44,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:45:44,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:45:44,658 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:44,681 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2021-12-22 16:45:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:45:44,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-22 16:45:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:44,683 INFO L225 Difference]: With dead ends: 65 [2021-12-22 16:45:44,683 INFO L226 Difference]: Without dead ends: 65 [2021-12-22 16:45:44,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:45:44,683 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:44,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-22 16:45:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-22 16:45:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-22 16:45:44,685 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2021-12-22 16:45:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:44,685 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-22 16:45:44,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-22 16:45:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:45:44,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:44,686 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:45:44,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:44,886 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-22 16:45:44,887 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2021-12-22 16:45:44,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:44,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867309674] [2021-12-22 16:45:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:44,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:45:44,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:44,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867309674] [2021-12-22 16:45:44,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867309674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:44,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:44,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:45:44,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819722784] [2021-12-22 16:45:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:44,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:45:44,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:45:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:45:44,997 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:45,167 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-12-22 16:45:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:45:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 16:45:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:45,168 INFO L225 Difference]: With dead ends: 116 [2021-12-22 16:45:45,168 INFO L226 Difference]: Without dead ends: 116 [2021-12-22 16:45:45,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:45:45,169 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 379 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:45,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 141 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:45:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-22 16:45:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2021-12-22 16:45:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2021-12-22 16:45:45,172 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2021-12-22 16:45:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:45,172 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2021-12-22 16:45:45,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-12-22 16:45:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:45:45,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:45,173 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:45:45,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:45:45,173 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:45,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2021-12-22 16:45:45,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572675576] [2021-12-22 16:45:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:45,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 16:45:45,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572675576] [2021-12-22 16:45:45,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572675576] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694390540] [2021-12-22 16:45:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:45,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:45,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:45,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 16:45:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:45,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 16:45:45,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-22 16:45:45,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:45:45,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694390540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:45,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 16:45:45,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2021-12-22 16:45:45,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220054598] [2021-12-22 16:45:45,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:45,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:45:45,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:45:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:45:45,357 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:45,388 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2021-12-22 16:45:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:45:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 16:45:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:45,389 INFO L225 Difference]: With dead ends: 96 [2021-12-22 16:45:45,389 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 16:45:45,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:45:45,389 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 105 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:45,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 151 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 16:45:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-22 16:45:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-22 16:45:45,392 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2021-12-22 16:45:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:45,392 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-22 16:45:45,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-22 16:45:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:45:45,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:45,393 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:45:45,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:45,610 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,SelfDestructingSolverStorable7 [2021-12-22 16:45:45,611 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2021-12-22 16:45:45,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:45,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069594210] [2021-12-22 16:45:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:45,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 16:45:45,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:45,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069594210] [2021-12-22 16:45:45,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069594210] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:45,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:45,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:45:45,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63062002] [2021-12-22 16:45:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:45,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:45:45,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:45:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:45:45,736 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:45,907 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-22 16:45:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:45:45,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 16:45:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:45,908 INFO L225 Difference]: With dead ends: 107 [2021-12-22 16:45:45,908 INFO L226 Difference]: Without dead ends: 107 [2021-12-22 16:45:45,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:45:45,909 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 365 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:45,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:45:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-22 16:45:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2021-12-22 16:45:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-12-22 16:45:45,912 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2021-12-22 16:45:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:45,912 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-12-22 16:45:45,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-12-22 16:45:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:45:45,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:45,913 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] [2021-12-22 16:45:45,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:45:45,913 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2021-12-22 16:45:45,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:45,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626317473] [2021-12-22 16:45:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:45,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:46,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626317473] [2021-12-22 16:45:46,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626317473] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568713999] [2021-12-22 16:45:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:46,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:46,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:46,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:46,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 16:45:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:46,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-22 16:45:46,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:46,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:45:46,351 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:45:46,351 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 12 treesize of output 18 [2021-12-22 16:45:46,445 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-22 16:45:46,584 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 21 treesize of output 9 [2021-12-22 16:45:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:46,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:45:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:46,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568713999] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:45:46,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:45:46,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2021-12-22 16:45:46,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508525989] [2021-12-22 16:45:46,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:45:46,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-22 16:45:46,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-22 16:45:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2021-12-22 16:45:46,808 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:47,624 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-12-22 16:45:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:45:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 16:45:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:47,628 INFO L225 Difference]: With dead ends: 105 [2021-12-22 16:45:47,628 INFO L226 Difference]: Without dead ends: 105 [2021-12-22 16:45:47,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2021-12-22 16:45:47,630 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 789 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:47,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 491 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:45:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-22 16:45:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2021-12-22 16:45:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-22 16:45:47,633 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2021-12-22 16:45:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:47,635 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-22 16:45:47,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-22 16:45:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:45:47,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:47,637 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] [2021-12-22 16:45:47,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:47,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:47,854 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2021-12-22 16:45:47,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:47,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223990708] [2021-12-22 16:45:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:47,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:48,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223990708] [2021-12-22 16:45:48,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223990708] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890894743] [2021-12-22 16:45:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:48,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:48,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:48,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:48,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 16:45:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:48,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-22 16:45:48,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:48,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:45:48,322 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:45:48,323 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-22 16:45:48,326 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-22 16:45:48,422 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 13 treesize of output 9 [2021-12-22 16:45:48,426 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-22 16:45:48,595 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 39 treesize of output 21 [2021-12-22 16:45:48,598 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 32 treesize of output 14 [2021-12-22 16:45:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:48,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:45:49,132 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 35 treesize of output 31 [2021-12-22 16:45:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:45:49,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890894743] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:45:49,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:45:49,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 43 [2021-12-22 16:45:49,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566765553] [2021-12-22 16:45:49,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:45:49,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-22 16:45:49,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-22 16:45:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2021-12-22 16:45:49,194 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:51,895 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2021-12-22 16:45:51,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 16:45:51,895 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 16:45:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:51,897 INFO L225 Difference]: With dead ends: 213 [2021-12-22 16:45:51,897 INFO L226 Difference]: Without dead ends: 213 [2021-12-22 16:45:51,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=818, Invalid=3738, Unknown=0, NotChecked=0, Total=4556 [2021-12-22 16:45:51,899 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 2835 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:51,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2835 Valid, 904 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1109 Invalid, 0 Unknown, 110 Unchecked, 0.6s Time] [2021-12-22 16:45:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-22 16:45:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2021-12-22 16:45:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-12-22 16:45:51,903 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2021-12-22 16:45:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:51,904 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-12-22 16:45:51,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-12-22 16:45:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 16:45:51,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:51,908 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] [2021-12-22 16:45:51,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:52,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:52,122 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:52,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2021-12-22 16:45:52,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:52,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370133506] [2021-12-22 16:45:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:52,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 16:45:52,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:52,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370133506] [2021-12-22 16:45:52,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370133506] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:52,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147741919] [2021-12-22 16:45:52,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:45:52,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:52,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:52,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 16:45:52,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:45:52,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:45:52,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 16:45:52,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-22 16:45:52,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:45:52,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147741919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:52,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 16:45:52,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2021-12-22 16:45:52,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231865025] [2021-12-22 16:45:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:52,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:45:52,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:52,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:45:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:45:52,423 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:52,443 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-12-22 16:45:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:45:52,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-22 16:45:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:52,443 INFO L225 Difference]: With dead ends: 70 [2021-12-22 16:45:52,443 INFO L226 Difference]: Without dead ends: 70 [2021-12-22 16:45:52,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:45:52,444 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:52,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 73 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-22 16:45:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-22 16:45:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-22 16:45:52,446 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2021-12-22 16:45:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:52,446 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-22 16:45:52,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-22 16:45:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 16:45:52,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:52,446 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] [2021-12-22 16:45:52,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:52,646 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,SelfDestructingSolverStorable11 [2021-12-22 16:45:52,647 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2021-12-22 16:45:52,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:52,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033339170] [2021-12-22 16:45:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:52,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-22 16:45:52,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:52,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033339170] [2021-12-22 16:45:52,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033339170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:52,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:52,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:45:52,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102825894] [2021-12-22 16:45:52,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:52,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:45:52,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:45:52,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:45:52,704 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:52,831 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-12-22 16:45:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:45:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-22 16:45:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:52,832 INFO L225 Difference]: With dead ends: 89 [2021-12-22 16:45:52,832 INFO L226 Difference]: Without dead ends: 89 [2021-12-22 16:45:52,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:45:52,833 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 337 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:52,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 109 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:45:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-22 16:45:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2021-12-22 16:45:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2021-12-22 16:45:52,835 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2021-12-22 16:45:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:52,835 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2021-12-22 16:45:52,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-12-22 16:45:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 16:45:52,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:52,836 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] [2021-12-22 16:45:52,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:45:52,836 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2021-12-22 16:45:52,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:52,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583321418] [2021-12-22 16:45:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:52,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 16:45:52,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583321418] [2021-12-22 16:45:52,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583321418] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579546444] [2021-12-22 16:45:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:52,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:52,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:52,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 16:45:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:53,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 16:45:53,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 16:45:53,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:45:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 16:45:53,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579546444] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:45:53,110 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:45:53,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2021-12-22 16:45:53,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207452329] [2021-12-22 16:45:53,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:45:53,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:45:53,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:53,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:45:53,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:45:53,112 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:53,140 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2021-12-22 16:45:53,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:45:53,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-22 16:45:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:53,141 INFO L225 Difference]: With dead ends: 95 [2021-12-22 16:45:53,141 INFO L226 Difference]: Without dead ends: 95 [2021-12-22 16:45:53,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:45:53,142 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:53,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 167 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-22 16:45:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2021-12-22 16:45:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2021-12-22 16:45:53,144 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2021-12-22 16:45:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:53,144 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2021-12-22 16:45:53,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2021-12-22 16:45:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 16:45:53,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:53,145 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] [2021-12-22 16:45:53,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:53,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:53,362 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2021-12-22 16:45:53,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:53,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370879010] [2021-12-22 16:45:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:53,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 16:45:53,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:53,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370879010] [2021-12-22 16:45:53,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370879010] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:53,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851182230] [2021-12-22 16:45:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:53,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:53,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:53,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:53,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 16:45:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:53,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 16:45:53,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 16:45:53,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:45:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 16:45:53,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851182230] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:45:53,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:45:53,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-22 16:45:53,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752989126] [2021-12-22 16:45:53,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:45:53,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:45:53,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:53,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:45:53,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:45:53,617 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:53,660 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2021-12-22 16:45:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:45:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-22 16:45:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:53,661 INFO L225 Difference]: With dead ends: 90 [2021-12-22 16:45:53,661 INFO L226 Difference]: Without dead ends: 90 [2021-12-22 16:45:53,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:45:53,662 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 141 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:53,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 165 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-22 16:45:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-12-22 16:45:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2021-12-22 16:45:53,664 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2021-12-22 16:45:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:53,664 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2021-12-22 16:45:53,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2021-12-22 16:45:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-22 16:45:53,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:53,665 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] [2021-12-22 16:45:53,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:53,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:53,879 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:53,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2021-12-22 16:45:53,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250887393] [2021-12-22 16:45:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:53,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 16:45:53,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:53,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250887393] [2021-12-22 16:45:53,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250887393] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:53,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077062020] [2021-12-22 16:45:53,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:45:53,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:53,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:53,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:53,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 16:45:54,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 16:45:54,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:45:54,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 16:45:54,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-22 16:45:54,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:45:54,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077062020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:54,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 16:45:54,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2021-12-22 16:45:54,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786670518] [2021-12-22 16:45:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:54,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:45:54,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:45:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:45:54,102 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:54,141 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-22 16:45:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:45:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-22 16:45:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:54,142 INFO L225 Difference]: With dead ends: 89 [2021-12-22 16:45:54,142 INFO L226 Difference]: Without dead ends: 89 [2021-12-22 16:45:54,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:45:54,143 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 136 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-22 16:45:54,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:45:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-22 16:45:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2021-12-22 16:45:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2021-12-22 16:45:54,147 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2021-12-22 16:45:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:54,147 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2021-12-22 16:45:54,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2021-12-22 16:45:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-22 16:45:54,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:54,148 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] [2021-12-22 16:45:54,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:54,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-22 16:45:54,355 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2021-12-22 16:45:54,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:54,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682124680] [2021-12-22 16:45:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:54,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 16:45:54,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:54,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682124680] [2021-12-22 16:45:54,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682124680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:45:54,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:45:54,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:45:54,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415974919] [2021-12-22 16:45:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:45:54,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:45:54,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:54,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:45:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:45:54,477 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:54,641 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-22 16:45:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:45:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-22 16:45:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:54,642 INFO L225 Difference]: With dead ends: 107 [2021-12-22 16:45:54,642 INFO L226 Difference]: Without dead ends: 107 [2021-12-22 16:45:54,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:45:54,642 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 413 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:54,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 80 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:45:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-22 16:45:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2021-12-22 16:45:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-22 16:45:54,644 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2021-12-22 16:45:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:54,644 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-22 16:45:54,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-22 16:45:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-22 16:45:54,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:54,645 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] [2021-12-22 16:45:54,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 16:45:54,645 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2021-12-22 16:45:54,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:54,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653603669] [2021-12-22 16:45:54,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:54,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:45:54,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:45:54,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653603669] [2021-12-22 16:45:54,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653603669] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:45:54,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662405194] [2021-12-22 16:45:54,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:54,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:45:54,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:45:54,919 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:45:54,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 16:45:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:45:55,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-22 16:45:55,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:45:55,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:45:55,070 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:45:55,070 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-22 16:45:55,132 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 13 treesize of output 9 [2021-12-22 16:45:55,312 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:45:55,313 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 34 treesize of output 35 [2021-12-22 16:45:55,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:45:55,392 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 33 treesize of output 26 [2021-12-22 16:45:55,445 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 31 treesize of output 13 [2021-12-22 16:45:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:45:55,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:45:58,181 INFO L353 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-22 16:45:58,182 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 21 treesize of output 20 [2021-12-22 16:45:58,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-22 16:45:58,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-22 16:45:58,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-22 16:45:58,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2021-12-22 16:45:58,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2021-12-22 16:45:58,211 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2021-12-22 16:45:58,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-22 16:45:58,227 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:45:58,228 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 22 treesize of output 23 [2021-12-22 16:45:58,230 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 36 treesize of output 24 [2021-12-22 16:45:58,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 7 treesize of output 3 [2021-12-22 16:45:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-22 16:45:58,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662405194] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:45:58,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:45:58,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2021-12-22 16:45:58,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261933959] [2021-12-22 16:45:58,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:45:58,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-22 16:45:58,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:45:58,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-22 16:45:58,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1690, Unknown=7, NotChecked=616, Total=2450 [2021-12-22 16:45:58,356 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:45:59,525 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-12-22 16:45:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-22 16:45:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-22 16:45:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:45:59,526 INFO L225 Difference]: With dead ends: 136 [2021-12-22 16:45:59,526 INFO L226 Difference]: Without dead ends: 136 [2021-12-22 16:45:59,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=617, Invalid=3826, Unknown=7, NotChecked=952, Total=5402 [2021-12-22 16:45:59,528 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 577 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:45:59,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 961 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1010 Invalid, 0 Unknown, 634 Unchecked, 0.4s Time] [2021-12-22 16:45:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-22 16:45:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2021-12-22 16:45:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2021-12-22 16:45:59,530 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2021-12-22 16:45:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:45:59,530 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2021-12-22 16:45:59,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:45:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2021-12-22 16:45:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-22 16:45:59,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:45:59,531 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] [2021-12-22 16:45:59,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-22 16:45:59,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-22 16:45:59,739 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:45:59,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:45:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2021-12-22 16:45:59,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:45:59,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935202916] [2021-12-22 16:45:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:45:59,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:45:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:46:00,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:00,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935202916] [2021-12-22 16:46:00,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935202916] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:46:00,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923561124] [2021-12-22 16:46:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:00,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:00,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:46:00,238 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:46:00,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 16:46:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:00,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-22 16:46:00,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:46:00,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:46:00,465 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:46:00,465 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-22 16:46:00,543 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-22 16:46:00,547 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 13 treesize of output 9 [2021-12-22 16:46:00,789 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:46:00,789 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 54 treesize of output 53 [2021-12-22 16:46:00,792 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 41 treesize of output 41 [2021-12-22 16:46:00,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:46:00,902 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 40 treesize of output 33 [2021-12-22 16:46:00,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:46:00,906 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 41 treesize of output 34 [2021-12-22 16:46:00,979 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 39 treesize of output 21 [2021-12-22 16:46:00,981 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 32 treesize of output 14 [2021-12-22 16:46:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:46:01,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:46:03,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1091 Int) (v_ArrVal_1093 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse0))))) (forall ((v_ArrVal_1093 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-22 16:46:03,301 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:03,301 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 56 treesize of output 60 [2021-12-22 16:46:03,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (forall ((v_prenex_2 Int) (v_ArrVal_1088 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|))))) is different from false [2021-12-22 16:46:03,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_prenex_2 Int) (v_ArrVal_1088 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-22 16:46:03,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_prenex_2 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1)))) (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-22 16:46:03,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (<= 0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse3))))))) is different from false [2021-12-22 16:46:03,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse1) .cse0)))) (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) v_ArrVal_1088) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse2)))) (forall ((v_prenex_2 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_1088) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))))))) is different from false [2021-12-22 16:46:03,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (<= 0 (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1088) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse0)))) (forall ((v_prenex_2 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1088) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse3)))))))) is different from false [2021-12-22 16:46:03,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (<= 0 (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1088) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse0)))) (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse2))))) (forall ((v_prenex_2 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1088) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))))) is different from false [2021-12-22 16:46:03,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:03,727 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 76 treesize of output 67 [2021-12-22 16:46:03,730 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 101 treesize of output 95 [2021-12-22 16:46:03,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:03,733 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 89 treesize of output 77 [2021-12-22 16:46:03,738 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:03,738 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 77 treesize of output 77 [2021-12-22 16:46:03,741 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 94 treesize of output 90 [2021-12-22 16:46:03,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:03,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 87 treesize of output 79 [2021-12-22 16:46:03,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:03,749 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 51 treesize of output 47 [2021-12-22 16:46:03,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:03,752 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 44 treesize of output 40 [2021-12-22 16:46:03,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:03,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 37 treesize of output 33 [2021-12-22 16:46:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-22 16:46:04,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923561124] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:46:04,058 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:46:04,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 55 [2021-12-22 16:46:04,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176788459] [2021-12-22 16:46:04,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:46:04,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-22 16:46:04,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:04,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-22 16:46:04,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2108, Unknown=8, NotChecked=792, Total=3080 [2021-12-22 16:46:04,060 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:19,368 WARN L227 SmtUtils]: Spent 14.25s on a formula simplification. DAG size of input: 64 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-22 16:46:20,034 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1091 Int) (v_ArrVal_1093 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse0))))) (forall ((v_ArrVal_1093 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) is different from false [2021-12-22 16:46:20,450 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse2 .cse5))) (and (<= (+ 4 .cse0) (select |c_#length| .cse1)) (<= 8 (select |c_#length| (select .cse2 4))) (= (select .cse3 4) 0) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_ArrVal_1091 Int) (v_ArrVal_1093 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse4))))) (forall ((v_ArrVal_1093 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))))))) is different from false [2021-12-22 16:46:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:20,967 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2021-12-22 16:46:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-22 16:46:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-22 16:46:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:20,968 INFO L225 Difference]: With dead ends: 151 [2021-12-22 16:46:20,968 INFO L226 Difference]: Without dead ends: 151 [2021-12-22 16:46:20,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=632, Invalid=4228, Unknown=10, NotChecked=1450, Total=6320 [2021-12-22 16:46:20,970 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 547 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1079 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:20,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1435 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1080 Invalid, 0 Unknown, 1079 Unchecked, 0.5s Time] [2021-12-22 16:46:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-22 16:46:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 90. [2021-12-22 16:46:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-22 16:46:20,972 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2021-12-22 16:46:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:20,973 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-22 16:46:20,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-22 16:46:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-22 16:46:20,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:20,974 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:20,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-22 16:46:21,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:21,183 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2021-12-22 16:46:21,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:21,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825602521] [2021-12-22 16:46:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:21,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 16:46:21,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:21,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825602521] [2021-12-22 16:46:21,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825602521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:46:21,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587755122] [2021-12-22 16:46:21,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:46:21,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:21,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:46:21,289 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:46:21,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-22 16:46:21,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:46:21,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:46:21,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 16:46:21,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:46:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-22 16:46:21,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:46:21,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587755122] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:46:21,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 16:46:21,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2021-12-22 16:46:21,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949320774] [2021-12-22 16:46:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:46:21,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:46:21,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:46:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:46:21,481 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:21,514 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-22 16:46:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:46:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-22 16:46:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:21,515 INFO L225 Difference]: With dead ends: 76 [2021-12-22 16:46:21,516 INFO L226 Difference]: Without dead ends: 76 [2021-12-22 16:46:21,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:46:21,516 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 85 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:21,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 93 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:46:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-22 16:46:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-22 16:46:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2021-12-22 16:46:21,518 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2021-12-22 16:46:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:21,518 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2021-12-22 16:46:21,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2021-12-22 16:46:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-22 16:46:21,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:21,519 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] [2021-12-22 16:46:21,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-22 16:46:21,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:21,728 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2021-12-22 16:46:21,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:21,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240202339] [2021-12-22 16:46:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:21,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:46:22,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:22,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240202339] [2021-12-22 16:46:22,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240202339] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:46:22,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581039521] [2021-12-22 16:46:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:22,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:46:22,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:46:22,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-22 16:46:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:22,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-22 16:46:22,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:46:22,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:46:22,525 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:46:22,525 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-22 16:46:22,595 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 13 treesize of output 9 [2021-12-22 16:46:22,598 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 6 treesize of output 5 [2021-12-22 16:46:22,844 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:46:22,844 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 68 treesize of output 65 [2021-12-22 16:46:22,847 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 33 treesize of output 23 [2021-12-22 16:46:22,850 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 36 treesize of output 38 [2021-12-22 16:46:22,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:46:22,986 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 45 treesize of output 38 [2021-12-22 16:46:22,990 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 30 treesize of output 32 [2021-12-22 16:46:22,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:46:22,999 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 35 treesize of output 34 [2021-12-22 16:46:23,136 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 50 treesize of output 32 [2021-12-22 16:46:23,141 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 34 treesize of output 22 [2021-12-22 16:46:23,257 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 26 treesize of output 18 [2021-12-22 16:46:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:46:23,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:46:23,638 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1312) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1310)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1312) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1310)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1)))) is different from false [2021-12-22 16:46:23,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0))) 1))) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:23,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:23,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 93 treesize of output 86 [2021-12-22 16:46:23,755 INFO L353 Elim1Store]: treesize reduction 90, result has 30.8 percent of original size [2021-12-22 16:46:23,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 169 [2021-12-22 16:46:23,762 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 125 treesize of output 111 [2021-12-22 16:46:23,766 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 111 treesize of output 97 [2021-12-22 16:46:23,856 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 .cse0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:23,951 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse0 .cse1) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse1 .cse0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:23,994 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3) v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:24,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))))) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:24,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:24,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:24,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))))) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-22 16:46:24,226 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:24,226 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 81 [2021-12-22 16:46:24,228 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 115 treesize of output 109 [2021-12-22 16:46:24,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:24,231 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 103 treesize of output 91 [2021-12-22 16:46:24,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:24,234 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 76 treesize of output 72 [2021-12-22 16:46:24,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:24,237 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 44 treesize of output 40 [2021-12-22 16:46:24,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:24,239 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 37 treesize of output 33 [2021-12-22 16:46:24,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:46:24,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 30 treesize of output 26 [2021-12-22 16:46:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-22 16:46:24,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581039521] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:46:24,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:46:24,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 26] total 64 [2021-12-22 16:46:24,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888730464] [2021-12-22 16:46:24,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:46:24,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-22 16:46:24,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-22 16:46:24,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2816, Unknown=9, NotChecked=1026, Total=4032 [2021-12-22 16:46:24,395 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:26,741 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))))) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2021-12-22 16:46:28,746 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-22 16:46:30,749 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-22 16:46:32,771 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))) is different from false [2021-12-22 16:46:34,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3))))) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4)))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (let ((.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse5) v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse5))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))))) is different from false [2021-12-22 16:46:36,782 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse2 .cse1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2021-12-22 16:46:38,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse1 .cse2) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse2 .cse1) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (not (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) is different from false [2021-12-22 16:46:40,841 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse2 .cse1) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2021-12-22 16:46:42,846 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))))) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))))) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2021-12-22 16:46:42,850 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_int| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2))) 1))) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))))) is different from false [2021-12-22 16:46:42,854 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse2 (+ (select (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (<= .cse1 .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse2 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3))) 1))) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2021-12-22 16:46:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:43,528 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-12-22 16:46:43,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-22 16:46:43,528 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-22 16:46:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:43,529 INFO L225 Difference]: With dead ends: 85 [2021-12-22 16:46:43,529 INFO L226 Difference]: Without dead ends: 85 [2021-12-22 16:46:43,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=470, Invalid=4846, Unknown=20, NotChecked=3220, Total=8556 [2021-12-22 16:46:43,531 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 145 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:43,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 978 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1094 Invalid, 0 Unknown, 566 Unchecked, 0.4s Time] [2021-12-22 16:46:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-22 16:46:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2021-12-22 16:46:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-12-22 16:46:43,533 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2021-12-22 16:46:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:43,533 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-12-22 16:46:43,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-12-22 16:46:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-22 16:46:43,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:43,533 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:43,553 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-22 16:46:43,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-22 16:46:43,734 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2021-12-22 16:46:43,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:43,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470694421] [2021-12-22 16:46:43,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:43,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:46:43,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:43,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470694421] [2021-12-22 16:46:43,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470694421] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:46:43,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135114228] [2021-12-22 16:46:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:43,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:43,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:46:43,932 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:46:43,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-22 16:46:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:44,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-22 16:46:44,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:46:44,433 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 15 treesize of output 11 [2021-12-22 16:46:44,637 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 15 treesize of output 7 [2021-12-22 16:46:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 16:46:44,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:46:44,792 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 36 treesize of output 32 [2021-12-22 16:46:44,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:46:44,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:46:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-22 16:46:44,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135114228] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:46:44,919 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:46:44,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 34 [2021-12-22 16:46:44,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380916709] [2021-12-22 16:46:44,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:46:44,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-22 16:46:44,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-22 16:46:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2021-12-22 16:46:44,920 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:45,771 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-12-22 16:46:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 16:46:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-22 16:46:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:45,773 INFO L225 Difference]: With dead ends: 99 [2021-12-22 16:46:45,774 INFO L226 Difference]: Without dead ends: 99 [2021-12-22 16:46:45,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2021-12-22 16:46:45,775 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 801 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:45,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [801 Valid, 465 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:46:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-22 16:46:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2021-12-22 16:46:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-22 16:46:45,777 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2021-12-22 16:46:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:45,777 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-22 16:46:45,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-22 16:46:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 16:46:45,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:45,778 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:45,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-22 16:46:45,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-22 16:46:45,991 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2021-12-22 16:46:45,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:45,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582529817] [2021-12-22 16:46:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:45,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-22 16:46:46,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:46,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582529817] [2021-12-22 16:46:46,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582529817] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:46:46,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619373575] [2021-12-22 16:46:46,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:46:46,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:46,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:46:46,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:46:46,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-22 16:46:46,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:46:46,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:46:46,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 16:46:46,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:46:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 16:46:46,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:46:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 16:46:46,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619373575] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:46:46,344 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:46:46,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-22 16:46:46,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657018174] [2021-12-22 16:46:46,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:46:46,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:46:46,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:46,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:46:46,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:46:46,346 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:46,392 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-12-22 16:46:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:46:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-22 16:46:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:46,393 INFO L225 Difference]: With dead ends: 71 [2021-12-22 16:46:46,393 INFO L226 Difference]: Without dead ends: 71 [2021-12-22 16:46:46,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-22 16:46:46,394 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 78 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:46,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 148 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:46:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-22 16:46:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-22 16:46:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-12-22 16:46:46,396 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2021-12-22 16:46:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:46,406 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-12-22 16:46:46,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-12-22 16:46:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 16:46:46,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:46,411 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:46,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-22 16:46:46,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:46,628 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2021-12-22 16:46:46,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:46,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845858629] [2021-12-22 16:46:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:46,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-22 16:46:46,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:46,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845858629] [2021-12-22 16:46:46,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845858629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:46:46,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:46:46,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:46:46,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92661943] [2021-12-22 16:46:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:46:46,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:46:46,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:46,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:46:46,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:46:46,693 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:46,831 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-22 16:46:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:46:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-22 16:46:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:46,832 INFO L225 Difference]: With dead ends: 82 [2021-12-22 16:46:46,832 INFO L226 Difference]: Without dead ends: 82 [2021-12-22 16:46:46,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:46:46,833 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 225 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:46,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 89 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:46:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-22 16:46:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2021-12-22 16:46:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2021-12-22 16:46:46,835 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2021-12-22 16:46:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:46,835 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2021-12-22 16:46:46,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-12-22 16:46:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 16:46:46,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:46,836 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:46,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 16:46:46,836 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2021-12-22 16:46:46,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:46,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200671681] [2021-12-22 16:46:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:46,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 16:46:46,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:46,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200671681] [2021-12-22 16:46:46,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200671681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:46:46,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:46:46,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:46:46,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312460377] [2021-12-22 16:46:46,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:46:46,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:46:46,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:46:46,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:46:46,916 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:47,032 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-12-22 16:46:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:46:47,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-22 16:46:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:47,033 INFO L225 Difference]: With dead ends: 80 [2021-12-22 16:46:47,033 INFO L226 Difference]: Without dead ends: 80 [2021-12-22 16:46:47,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:46:47,033 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:47,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 52 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:46:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-22 16:46:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2021-12-22 16:46:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-12-22 16:46:47,035 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2021-12-22 16:46:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:47,035 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-12-22 16:46:47,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2021-12-22 16:46:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-22 16:46:47,035 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:47,035 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:47,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 16:46:47,035 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2021-12-22 16:46:47,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:47,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120890614] [2021-12-22 16:46:47,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:47,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 16:46:47,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:47,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120890614] [2021-12-22 16:46:47,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120890614] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:46:47,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:46:47,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:46:47,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621219183] [2021-12-22 16:46:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:46:47,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:46:47,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:47,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:46:47,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:46:47,100 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:47,161 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-12-22 16:46:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:46:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-22 16:46:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:47,162 INFO L225 Difference]: With dead ends: 77 [2021-12-22 16:46:47,162 INFO L226 Difference]: Without dead ends: 77 [2021-12-22 16:46:47,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:46:47,163 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 265 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:47,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 81 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:46:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-22 16:46:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-12-22 16:46:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-22 16:46:47,164 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2021-12-22 16:46:47,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:47,164 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-22 16:46:47,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-22 16:46:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-22 16:46:47,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:47,165 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:47,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-22 16:46:47,165 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2021-12-22 16:46:47,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:47,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200973567] [2021-12-22 16:46:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:47,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 16:46:47,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200973567] [2021-12-22 16:46:47,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200973567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:46:47,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:46:47,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:46:47,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437204573] [2021-12-22 16:46:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:46:47,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:46:47,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:46:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:46:47,267 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:46:47,382 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-12-22 16:46:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:46:47,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-22 16:46:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:46:47,383 INFO L225 Difference]: With dead ends: 75 [2021-12-22 16:46:47,383 INFO L226 Difference]: Without dead ends: 75 [2021-12-22 16:46:47,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:46:47,383 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:46:47,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:46:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-22 16:46:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-22 16:46:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-22 16:46:47,385 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2021-12-22 16:46:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:46:47,385 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-22 16:46:47,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:46:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-22 16:46:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 16:46:47,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:46:47,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:46:47,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-22 16:46:47,385 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-22 16:46:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:46:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2021-12-22 16:46:47,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:46:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262985408] [2021-12-22 16:46:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:47,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:46:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-22 16:46:47,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:46:47,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262985408] [2021-12-22 16:46:47,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262985408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:46:47,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65964642] [2021-12-22 16:46:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:46:47,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:46:47,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:46:47,640 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 16:46:47,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-22 16:46:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:46:47,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-22 16:46:47,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:46:47,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:46:47,826 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-22 16:46:47,827 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-22 16:46:47,917 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 13 treesize of output 9 [2021-12-22 16:46:48,167 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:46:48,167 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 30 treesize of output 31 [2021-12-22 16:46:48,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:46:48,239 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 29 treesize of output 24 [2021-12-22 16:46:48,420 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:48,420 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 27 treesize of output 23 [2021-12-22 16:46:48,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-22 16:46:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-22 16:46:48,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:46:51,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1)) (forall ((v_ArrVal_1845 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-22 16:46:51,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1)) (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4))))))) is different from false [2021-12-22 16:46:51,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)))) (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))))) is different from false [2021-12-22 16:46:51,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1)) (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-22 16:46:51,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)))) (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))))) is different from false [2021-12-22 16:46:51,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1)) (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4))))))) is different from false [2021-12-22 16:46:51,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1)) (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) is different from false [2021-12-22 16:46:51,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)))) (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1845 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-22 16:46:51,355 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:51,356 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 50 treesize of output 41 [2021-12-22 16:46:51,359 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 73 treesize of output 67 [2021-12-22 16:46:51,366 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:46:51,366 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 90 treesize of output 92 [2021-12-22 16:46:51,370 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 89 treesize of output 87 [2021-12-22 16:46:51,374 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 98 treesize of output 96 [2021-12-22 16:46:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-22 16:46:51,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65964642] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:46:51,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:46:51,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 53 [2021-12-22 16:46:51,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24515145] [2021-12-22 16:46:51,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:46:51,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-22 16:46:51,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:46:51,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-22 16:46:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1927, Unknown=8, NotChecked=760, Total=2862 [2021-12-22 16:46:51,788 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 54 states, 53 states have (on average 2.509433962264151) internal successors, (133), 54 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)