./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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-ext-properties/test-0513_1.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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:54:40,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:54:40,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:54:40,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:54:40,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:54:40,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:54:40,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:54:40,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:54:40,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:54:40,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:54:40,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:54:40,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:54:40,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:54:40,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:54:40,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:54:40,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:54:40,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:54:40,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:54:40,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:54:40,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:54:40,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:54:40,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:54:40,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:54:40,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:54:40,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:54:40,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:54:40,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:54:40,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:54:40,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:54:40,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:54:40,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:54:40,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:54:40,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:54:40,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:54:40,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:54:40,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:54:40,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:54:40,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:54:40,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:54:40,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:54:40,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:54:40,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 05:54:40,432 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:54:40,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:54:40,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:54:40,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:54:40,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:54:40,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:54:40,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:54:40,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:54:40,434 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:54:40,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:54:40,435 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:54:40,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:54:40,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:54:40,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:54:40,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:54:40,436 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:54:40,436 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:54:40,436 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:54:40,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:54:40,436 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:54:40,436 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:54:40,436 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:54:40,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:54:40,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:54:40,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:54:40,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:54:40,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:54:40,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:54:40,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:54:40,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:54:40,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:54:40,438 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2021-12-16 05:54:40,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:54:40,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:54:40,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:54:40,648 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:54:40,648 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:54:40,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2021-12-16 05:54:40,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba365fe0/fb13a825d7b640c68374146e29850317/FLAG9287f0892 [2021-12-16 05:54:41,089 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:54:41,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2021-12-16 05:54:41,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba365fe0/fb13a825d7b640c68374146e29850317/FLAG9287f0892 [2021-12-16 05:54:41,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba365fe0/fb13a825d7b640c68374146e29850317 [2021-12-16 05:54:41,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:54:41,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:54:41,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:54:41,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:54:41,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:54:41,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41, skipping insertion in model container [2021-12-16 05:54:41,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:54:41,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:54:41,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:54:41,712 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:54:41,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:54:41,759 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:54:41,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41 WrapperNode [2021-12-16 05:54:41,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:54:41,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:54:41,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:54:41,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:54:41,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,798 INFO L137 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2021-12-16 05:54:41,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:54:41,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:54:41,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:54:41,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:54:41,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:54:41,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:54:41,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:54:41,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:54:41,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (1/1) ... [2021-12-16 05:54:41,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:54:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:41,859 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-16 05:54:41,860 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-16 05:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:54:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:54:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:54:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:54:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:54:41,994 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:54:41,995 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:54:42,355 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:54:42,363 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:54:42,363 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 05:54:42,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:54:42 BoogieIcfgContainer [2021-12-16 05:54:42,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:54:42,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:54:42,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:54:42,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:54:42,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:54:41" (1/3) ... [2021-12-16 05:54:42,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459eea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:54:42, skipping insertion in model container [2021-12-16 05:54:42,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:54:41" (2/3) ... [2021-12-16 05:54:42,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459eea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:54:42, skipping insertion in model container [2021-12-16 05:54:42,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:54:42" (3/3) ... [2021-12-16 05:54:42,374 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2021-12-16 05:54:42,378 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:54:42,379 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-12-16 05:54:42,409 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:54:42,416 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-16 05:54:42,416 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-12-16 05:54:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 05:54:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:54:42,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:54:42,441 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,448 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2021-12-16 05:54:42,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504699396] [2021-12-16 05:54:42,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,550 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-16 05:54:42,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504699396] [2021-12-16 05:54:42,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504699396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:42,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120724295] [2021-12-16 05:54:42,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 05:54:42,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 05:54:42,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:54:42,581 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-16 05:54:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,604 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2021-12-16 05:54:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 05:54:42,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-16 05:54:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,614 INFO L225 Difference]: With dead ends: 151 [2021-12-16 05:54:42,614 INFO L226 Difference]: Without dead ends: 149 [2021-12-16 05:54:42,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:54:42,619 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-16 05:54:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-12-16 05:54:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 05:54:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2021-12-16 05:54:42,667 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2021-12-16 05:54:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,667 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2021-12-16 05:54:42,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-16 05:54:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2021-12-16 05:54:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:54:42,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:54:42,669 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2021-12-16 05:54:42,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139364386] [2021-12-16 05:54:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,732 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-16 05:54:42,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139364386] [2021-12-16 05:54:42,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139364386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:42,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961989123] [2021-12-16 05:54:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:42,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:42,739 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,867 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2021-12-16 05:54:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:54:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,872 INFO L225 Difference]: With dead ends: 196 [2021-12-16 05:54:42,872 INFO L226 Difference]: Without dead ends: 195 [2021-12-16 05:54:42,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:42,876 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-16 05:54:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2021-12-16 05:54:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 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-16 05:54:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2021-12-16 05:54:42,885 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2021-12-16 05:54:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,886 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2021-12-16 05:54:42,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2021-12-16 05:54:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:54:42,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:54:42,889 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2021-12-16 05:54:42,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658855339] [2021-12-16 05:54:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:42,923 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-16 05:54:42,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:42,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658855339] [2021-12-16 05:54:42,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658855339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:42,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:42,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:42,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41420575] [2021-12-16 05:54:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:42,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:42,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:42,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:42,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:42,926 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:42,967 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2021-12-16 05:54:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:42,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:54:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:42,968 INFO L225 Difference]: With dead ends: 173 [2021-12-16 05:54:42,968 INFO L226 Difference]: Without dead ends: 172 [2021-12-16 05:54:42,969 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-16 05:54:42,974 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:42,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-16 05:54:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2021-12-16 05:54:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2021-12-16 05:54:42,988 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2021-12-16 05:54:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:42,988 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2021-12-16 05:54:42,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2021-12-16 05:54:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:54:42,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:42,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:42,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:54:42,990 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2021-12-16 05:54:42,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:42,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214860249] [2021-12-16 05:54:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:42,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,027 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-16 05:54:43,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214860249] [2021-12-16 05:54:43,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214860249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:43,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316686585] [2021-12-16 05:54:43,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:43,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:43,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:43,029 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,143 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2021-12-16 05:54:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:43,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:54:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,144 INFO L225 Difference]: With dead ends: 191 [2021-12-16 05:54:43,144 INFO L226 Difference]: Without dead ends: 191 [2021-12-16 05:54:43,145 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-16 05:54:43,145 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 196 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-16 05:54:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-12-16 05:54:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 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-16 05:54:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2021-12-16 05:54:43,150 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2021-12-16 05:54:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,150 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2021-12-16 05:54:43,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2021-12-16 05:54:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 05:54:43,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:54:43,155 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2021-12-16 05:54:43,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76497972] [2021-12-16 05:54:43,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,186 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-16 05:54:43,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76497972] [2021-12-16 05:54:43,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76497972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:43,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843361652] [2021-12-16 05:54:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:43,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:43,189 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,261 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2021-12-16 05:54:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:43,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 05:54:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,262 INFO L225 Difference]: With dead ends: 157 [2021-12-16 05:54:43,262 INFO L226 Difference]: Without dead ends: 157 [2021-12-16 05:54:43,263 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-16 05:54:43,263 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-16 05:54:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-12-16 05:54:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 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-16 05:54:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2021-12-16 05:54:43,267 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2021-12-16 05:54:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,267 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2021-12-16 05:54:43,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-16 05:54:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2021-12-16 05:54:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 05:54:43,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:54:43,268 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2021-12-16 05:54:43,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173911306] [2021-12-16 05:54:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,302 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-16 05:54:43,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173911306] [2021-12-16 05:54:43,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173911306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:43,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341984413] [2021-12-16 05:54:43,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:43,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:43,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:43,304 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 05:54:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,328 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2021-12-16 05:54:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:54:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-16 05:54:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,329 INFO L225 Difference]: With dead ends: 295 [2021-12-16 05:54:43,329 INFO L226 Difference]: Without dead ends: 295 [2021-12-16 05:54:43,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:43,331 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 149 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 454 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:54:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-12-16 05:54:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2021-12-16 05:54:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 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-16 05:54:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2021-12-16 05:54:43,337 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2021-12-16 05:54:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,338 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2021-12-16 05:54:43,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 05:54:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2021-12-16 05:54:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:54:43,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:54:43,339 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2021-12-16 05:54:43,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660027220] [2021-12-16 05:54:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,411 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-16 05:54:43,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660027220] [2021-12-16 05:54:43,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660027220] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:43,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767764847] [2021-12-16 05:54:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:43,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:43,413 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 05:54:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,470 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2021-12-16 05:54:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:43,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-16 05:54:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,471 INFO L225 Difference]: With dead ends: 156 [2021-12-16 05:54:43,471 INFO L226 Difference]: Without dead ends: 156 [2021-12-16 05:54:43,471 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-16 05:54:43,472 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-16 05:54:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-16 05:54:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 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-16 05:54:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2021-12-16 05:54:43,475 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2021-12-16 05:54:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,475 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2021-12-16 05:54:43,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 05:54:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2021-12-16 05:54:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 05:54:43,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:54:43,476 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2021-12-16 05:54:43,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495801287] [2021-12-16 05:54:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,511 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-16 05:54:43,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495801287] [2021-12-16 05:54:43,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495801287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:54:43,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69613876] [2021-12-16 05:54:43,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:54:43,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:54:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:54:43,513 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 05:54:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,574 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2021-12-16 05:54:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:43,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-16 05:54:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,576 INFO L225 Difference]: With dead ends: 153 [2021-12-16 05:54:43,576 INFO L226 Difference]: Without dead ends: 153 [2021-12-16 05:54:43,576 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-16 05:54:43,577 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-16 05:54:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-16 05:54:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 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-16 05:54:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2021-12-16 05:54:43,580 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2021-12-16 05:54:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,581 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2021-12-16 05:54:43,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-16 05:54:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2021-12-16 05:54:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:54:43,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,582 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:54:43,582 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:43,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2021-12-16 05:54:43,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331238944] [2021-12-16 05:54:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:43,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331238944] [2021-12-16 05:54:43,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331238944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:43,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651977622] [2021-12-16 05:54:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:43,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:43,656 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-16 05:54:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,733 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2021-12-16 05:54:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:43,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 24 [2021-12-16 05:54:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,734 INFO L225 Difference]: With dead ends: 261 [2021-12-16 05:54:43,734 INFO L226 Difference]: Without dead ends: 261 [2021-12-16 05:54:43,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:43,735 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-16 05:54:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2021-12-16 05:54:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 05:54:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2021-12-16 05:54:43,738 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2021-12-16 05:54:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,738 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2021-12-16 05:54:43,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-16 05:54:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2021-12-16 05:54:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:54:43,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,739 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:54:43,739 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:43,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2021-12-16 05:54:43,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148572355] [2021-12-16 05:54:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:43,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148572355] [2021-12-16 05:54:43,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148572355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:43,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527905338] [2021-12-16 05:54:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:43,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:43,821 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-16 05:54:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:43,927 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2021-12-16 05:54:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:43,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 24 [2021-12-16 05:54:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:43,928 INFO L225 Difference]: With dead ends: 147 [2021-12-16 05:54:43,928 INFO L226 Difference]: Without dead ends: 147 [2021-12-16 05:54:43,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:43,929 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:43,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 224 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-16 05:54:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2021-12-16 05:54:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 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-16 05:54:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2021-12-16 05:54:43,932 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2021-12-16 05:54:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:43,932 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2021-12-16 05:54:43,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-16 05:54:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2021-12-16 05:54:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 05:54:43,933 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:43,933 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:43,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:54:43,933 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2021-12-16 05:54:43,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:43,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790561880] [2021-12-16 05:54:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:43,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:43,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:43,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790561880] [2021-12-16 05:54:43,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790561880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:43,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:43,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:43,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452022060] [2021-12-16 05:54:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:43,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:43,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:43,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:43,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:43,977 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-16 05:54:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,122 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2021-12-16 05:54:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:44,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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 24 [2021-12-16 05:54:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,123 INFO L225 Difference]: With dead ends: 237 [2021-12-16 05:54:44,123 INFO L226 Difference]: Without dead ends: 237 [2021-12-16 05:54:44,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:44,124 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 120 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 220 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-16 05:54:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 185. [2021-12-16 05:54:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 states have internal predecessors, (235), 0 states have call successors, (0), 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-16 05:54:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2021-12-16 05:54:44,127 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2021-12-16 05:54:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,127 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2021-12-16 05:54:44,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-16 05:54:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2021-12-16 05:54:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 05:54:44,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,128 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:54:44,128 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2021-12-16 05:54:44,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447536821] [2021-12-16 05:54:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447536821] [2021-12-16 05:54:44,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447536821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:44,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:54:44,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201811537] [2021-12-16 05:54:44,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:54:44,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:54:44,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:44,171 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,252 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2021-12-16 05:54:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:54:44,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,253 INFO L225 Difference]: With dead ends: 238 [2021-12-16 05:54:44,254 INFO L226 Difference]: Without dead ends: 238 [2021-12-16 05:54:44,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:54:44,254 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 258 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 360 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-16 05:54:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2021-12-16 05:54:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 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-16 05:54:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2021-12-16 05:54:44,258 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2021-12-16 05:54:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,258 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2021-12-16 05:54:44,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2021-12-16 05:54:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 05:54:44,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,259 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:54:44,259 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2021-12-16 05:54:44,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620195251] [2021-12-16 05:54:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620195251] [2021-12-16 05:54:44,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620195251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:44,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:54:44,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183947527] [2021-12-16 05:54:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:54:44,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:54:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:54:44,319 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,451 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2021-12-16 05:54:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:54:44,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,452 INFO L225 Difference]: With dead ends: 213 [2021-12-16 05:54:44,452 INFO L226 Difference]: Without dead ends: 213 [2021-12-16 05:54:44,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:54:44,453 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 336 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-16 05:54:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2021-12-16 05:54:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 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-16 05:54:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2021-12-16 05:54:44,456 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2021-12-16 05:54:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,456 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2021-12-16 05:54:44,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2021-12-16 05:54:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 05:54:44,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,457 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:54:44,457 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:44,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2021-12-16 05:54:44,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46040674] [2021-12-16 05:54:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46040674] [2021-12-16 05:54:44,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46040674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:44,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:54:44,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76670358] [2021-12-16 05:54:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:54:44,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:54:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:54:44,526 INFO L87 Difference]: Start difference. First operand 198 states and 252 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:44,635 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2021-12-16 05:54:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:54:44,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:44,636 INFO L225 Difference]: With dead ends: 225 [2021-12-16 05:54:44,637 INFO L226 Difference]: Without dead ends: 225 [2021-12-16 05:54:44,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:54:44,637 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:44,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 506 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-16 05:54:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2021-12-16 05:54:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 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-16 05:54:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2021-12-16 05:54:44,640 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2021-12-16 05:54:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:44,641 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2021-12-16 05:54:44,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 05:54:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2021-12-16 05:54:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:54:44,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:44,641 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:44,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:54:44,642 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2021-12-16 05:54:44,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:44,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54878383] [2021-12-16 05:54:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:44,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:44,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:44,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54878383] [2021-12-16 05:54:44,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54878383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:44,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:44,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:54:44,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235400341] [2021-12-16 05:54:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:44,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:54:44,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:44,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:54:44,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:54:44,828 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:45,300 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2021-12-16 05:54:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:54:45,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:45,301 INFO L225 Difference]: With dead ends: 307 [2021-12-16 05:54:45,302 INFO L226 Difference]: Without dead ends: 307 [2021-12-16 05:54:45,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:54:45,302 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 162 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:45,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 508 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 05:54:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-16 05:54:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2021-12-16 05:54:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 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-16 05:54:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2021-12-16 05:54:45,306 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2021-12-16 05:54:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:45,307 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2021-12-16 05:54:45,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2021-12-16 05:54:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:54:45,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:45,307 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:45,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:54:45,308 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2021-12-16 05:54:45,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:45,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793584068] [2021-12-16 05:54:45,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:45,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:45,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:45,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793584068] [2021-12-16 05:54:45,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793584068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:45,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:45,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:54:45,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218403238] [2021-12-16 05:54:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:45,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:54:45,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:45,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:54:45,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:54:45,481 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:45,870 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2021-12-16 05:54:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:54:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:45,873 INFO L225 Difference]: With dead ends: 309 [2021-12-16 05:54:45,873 INFO L226 Difference]: Without dead ends: 309 [2021-12-16 05:54:45,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:54:45,873 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 173 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:45,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 428 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:54:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-12-16 05:54:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2021-12-16 05:54:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2021-12-16 05:54:45,878 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2021-12-16 05:54:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:45,879 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2021-12-16 05:54:45,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2021-12-16 05:54:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:54:45,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:45,881 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:45,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:54:45,881 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2021-12-16 05:54:45,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881227848] [2021-12-16 05:54:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:45,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:45,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:45,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881227848] [2021-12-16 05:54:45,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881227848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:45,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:45,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:54:45,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978502388] [2021-12-16 05:54:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:45,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:54:45,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:54:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:54:45,978 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-16 05:54:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:46,104 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2021-12-16 05:54:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:54:46,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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 33 [2021-12-16 05:54:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:46,105 INFO L225 Difference]: With dead ends: 254 [2021-12-16 05:54:46,105 INFO L226 Difference]: Without dead ends: 254 [2021-12-16 05:54:46,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:54:46,106 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:46,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 504 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-16 05:54:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2021-12-16 05:54:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 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-16 05:54:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2021-12-16 05:54:46,109 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2021-12-16 05:54:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:46,109 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2021-12-16 05:54:46,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-16 05:54:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2021-12-16 05:54:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 05:54:46,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:46,110 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:46,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:54:46,110 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2021-12-16 05:54:46,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:46,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246817626] [2021-12-16 05:54:46,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:46,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 05:54:46,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246817626] [2021-12-16 05:54:46,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246817626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:46,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:46,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:46,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129139418] [2021-12-16 05:54:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:46,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:46,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:46,145 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:46,271 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2021-12-16 05:54:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:54:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 05:54:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:46,273 INFO L225 Difference]: With dead ends: 299 [2021-12-16 05:54:46,273 INFO L226 Difference]: Without dead ends: 299 [2021-12-16 05:54:46,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:54:46,273 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:46,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 265 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-16 05:54:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2021-12-16 05:54:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 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-16 05:54:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2021-12-16 05:54:46,277 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2021-12-16 05:54:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:46,277 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2021-12-16 05:54:46,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 05:54:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-12-16 05:54:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 05:54:46,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:46,279 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:46,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 05:54:46,280 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2021-12-16 05:54:46,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:46,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152622480] [2021-12-16 05:54:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:46,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:46,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:46,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152622480] [2021-12-16 05:54:46,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152622480] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:46,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:46,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 05:54:46,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781904586] [2021-12-16 05:54:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:46,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 05:54:46,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:54:46,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 05:54:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:54:46,483 INFO L87 Difference]: Start difference. First operand 228 states and 294 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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-16 05:54:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:46,930 INFO L93 Difference]: Finished difference Result 328 states and 402 transitions. [2021-12-16 05:54:46,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 05:54:46,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 05:54:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:46,932 INFO L225 Difference]: With dead ends: 328 [2021-12-16 05:54:46,932 INFO L226 Difference]: Without dead ends: 328 [2021-12-16 05:54:46,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2021-12-16 05:54:46,932 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 210 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:46,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 427 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:54:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-12-16 05:54:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2021-12-16 05:54:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 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-16 05:54:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2021-12-16 05:54:46,936 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 34 [2021-12-16 05:54:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:46,936 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2021-12-16 05:54:46,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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-16 05:54:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2021-12-16 05:54:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 05:54:46,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:46,937 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:46,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 05:54:46,937 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:54:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2021-12-16 05:54:46,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:54:46,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073439989] [2021-12-16 05:54:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:46,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:54:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:47,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:54:47,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073439989] [2021-12-16 05:54:47,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073439989] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:54:47,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726919797] [2021-12-16 05:54:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:47,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:54:47,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:54:47,175 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-16 05:54:47,206 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-16 05:54:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:47,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-16 05:54:47,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:47,375 INFO L388 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 11 treesize of output 7 [2021-12-16 05:54:47,379 INFO L388 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 11 treesize of output 7 [2021-12-16 05:54:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:47,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:47,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:47,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:47,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:47,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:47,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:47,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:47,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:47,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:47,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:47,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:47,575 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:54:47,576 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-16 05:54:47,583 INFO L388 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 5 treesize of output 3 [2021-12-16 05:54:47,597 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:54:47,597 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-16 05:54:47,602 INFO L388 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 5 treesize of output 3 [2021-12-16 05:54:47,683 INFO L388 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 23 treesize of output 22 [2021-12-16 05:54:47,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-12-16 05:54:48,030 INFO L388 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-16 05:54:48,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:48,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:48,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:48,550 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 05:54:48,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 49 [2021-12-16 05:54:48,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:54:48,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:54:48,569 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 05:54:48,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2021-12-16 05:54:48,577 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:48,577 INFO L388 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-16 05:54:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:48,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:48,698 INFO L388 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 10 treesize of output 8 [2021-12-16 05:54:59,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse4))) (or (< |ULTIMATE.start_main_~data~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse1 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse2 (select .cse1 .cse4))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse1) .cse0) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse3) .cse0) .cse2) 0)))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|)))))) is different from false [2021-12-16 05:54:59,429 INFO L354 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2021-12-16 05:54:59,429 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 168 [2021-12-16 05:54:59,449 INFO L354 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2021-12-16 05:54:59,450 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 225 treesize of output 211 [2021-12-16 05:55:00,559 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:00,560 INFO L388 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 27 treesize of output 31 [2021-12-16 05:55:00,628 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:00,629 INFO L388 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 34 treesize of output 34 [2021-12-16 05:55:00,667 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:00,668 INFO L388 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 27 treesize of output 31 [2021-12-16 05:55:00,750 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:00,751 INFO L388 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 34 treesize of output 34 [2021-12-16 05:55:00,839 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:00,839 INFO L388 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 27 treesize of output 31 [2021-12-16 05:55:01,045 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:01,045 INFO L388 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 34 treesize of output 34 [2021-12-16 05:55:01,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse1 (select v_arrayElimArr_1 .cse3)) (.cse0 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (or (< |ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select v_arrayElimArr_1 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (and (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse1) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) .cse2) 0))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) is different from false [2021-12-16 05:55:01,222 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:01,222 INFO L388 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 27 treesize of output 31 [2021-12-16 05:55:01,279 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:01,279 INFO L388 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 34 treesize of output 34 [2021-12-16 05:55:01,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:01,353 INFO L388 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 27 treesize of output 31 [2021-12-16 05:55:01,543 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:01,544 INFO L388 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 34 treesize of output 34 [2021-12-16 05:55:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:01,670 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-16 05:55:01,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:01,708 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2021-12-16 05:55:01,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:01,769 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2021-12-16 05:55:01,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:01,794 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-16 05:55:01,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (select v_arrayElimArr_1 .cse2))) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse1 (select v_arrayElimArr_2 .cse2))) (and (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) .cse1) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) .cse1) 0))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) is different from false [2021-12-16 05:55:01,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:01,866 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:01,937 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,013 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,053 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,138 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,172 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (and (forall ((v_ArrVal_613 Int)) (= (let ((.cse0 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_1 .cse0)) (select v_arrayElimArr_2 .cse0))) 0)) (forall ((v_ArrVal_611 Int)) (= (let ((.cse1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 .cse1)) (select v_arrayElimArr_2 .cse1))) 0))) (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4)) |ULTIMATE.start_main_~lItem~0#1.base|) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) is different from false [2021-12-16 05:55:02,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,244 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,286 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,365 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,395 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,466 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,515 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,610 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,637 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,704 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,743 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,816 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:02,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,851 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,927 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:02,971 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:03,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:03,052 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:03,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:03,082 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:03,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:03,167 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:03,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:03,232 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:03,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:03,297 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-16 05:55:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:55:03,325 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-12-16 05:55:03,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:55:03,385 INFO L354 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2021-12-16 05:55:03,385 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 1 [2021-12-16 05:55:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:03,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726919797] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:55:03,392 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:55:03,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2021-12-16 05:55:03,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333253395] [2021-12-16 05:55:03,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:55:03,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-16 05:55:03,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:55:03,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-16 05:55:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1071, Unknown=7, NotChecked=276, Total=1482 [2021-12-16 05:55:03,394 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 05:55:03,432 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~c1~0#1|) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (and (forall ((v_ArrVal_613 Int)) (= (let ((.cse0 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_1 .cse0)) (select v_arrayElimArr_2 .cse0))) 0)) (forall ((v_ArrVal_611 Int)) (= (let ((.cse1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 .cse1)) (select v_arrayElimArr_2 .cse1))) 0))) (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4)) |ULTIMATE.start_main_~lItem~0#1.base|) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:55:03,437 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (select v_arrayElimArr_1 .cse2))) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse1 (select v_arrayElimArr_2 .cse2))) (and (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) .cse1) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) .cse1) 0))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:55:03,441 WARN L838 $PredicateComparison]: unable to prove that (and (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse1 (select v_arrayElimArr_1 .cse3)) (.cse0 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (or (< |ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select v_arrayElimArr_1 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (and (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse1) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) .cse2) 0))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:55:04,841 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base|))) (and (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (or (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) .cse0) (or .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse5 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse1 (select .cse4 .cse5))) (or (< |ULTIMATE.start_main_~data~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse3 (select .cse2 .cse5))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse2) .cse1) .cse3) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse4) .cse1) .cse3) 0)))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|)))))) (not .cse0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) is different from false [2021-12-16 05:55:05,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) .cse4))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (and (forall ((v_ArrVal_613 Int)) (= (let ((.cse1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_1 .cse1)) (select v_arrayElimArr_2 .cse1))) 0)) (forall ((v_ArrVal_611 Int)) (= (let ((.cse2 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 .cse2)) (select v_arrayElimArr_2 .cse2))) 0))) (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4)) |ULTIMATE.start_main_~lItem~0#1.base|) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (<= 6 (select (select |c_#memory_int| .cse3) 4)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) 0)) (< 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (= .cse3 |c_ULTIMATE.start_main_~data~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) is different from false [2021-12-16 05:55:05,147 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (and (forall ((v_ArrVal_613 Int)) (= (let ((.cse0 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_1 .cse0)) (select v_arrayElimArr_2 .cse0))) 0)) (forall ((v_ArrVal_611 Int)) (= (let ((.cse1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 .cse1)) (select v_arrayElimArr_2 .cse1))) 0))) (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~data~0#1.offset| 4)) |ULTIMATE.start_main_~lItem~0#1.base|) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:55:26,678 WARN L227 SmtUtils]: Spent 21.50s on a formula simplification. DAG size of input: 79 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 05:55:26,831 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (select v_arrayElimArr_1 .cse2))) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse1 (select v_arrayElimArr_2 .cse2))) (and (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) .cse1) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) .cse1) 0))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:55:26,864 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ |ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse1 (select v_arrayElimArr_1 .cse3)) (.cse0 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (or (< |ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select v_arrayElimArr_1 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (and (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse1) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) .cse2) 0))) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:55:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:27,249 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2021-12-16 05:55:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-16 05:55:27,249 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 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 39 [2021-12-16 05:55:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:27,250 INFO L225 Difference]: With dead ends: 258 [2021-12-16 05:55:27,250 INFO L226 Difference]: Without dead ends: 258 [2021-12-16 05:55:27,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=291, Invalid=1998, Unknown=15, NotChecked=1236, Total=3540 [2021-12-16 05:55:27,251 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 171 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 719 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:27,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 1832 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 872 Invalid, 0 Unknown, 719 Unchecked, 0.4s Time] [2021-12-16 05:55:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-16 05:55:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2021-12-16 05:55:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 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-16 05:55:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2021-12-16 05:55:27,255 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 39 [2021-12-16 05:55:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:27,255 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2021-12-16 05:55:27,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 05:55:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2021-12-16 05:55:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 05:55:27,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:27,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:27,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 05:55:27,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:55:27,467 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:55:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2021-12-16 05:55:27,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:55:27,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024329763] [2021-12-16 05:55:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:27,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:55:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:27,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:55:27,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024329763] [2021-12-16 05:55:27,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024329763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:27,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:27,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:55:27,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471939103] [2021-12-16 05:55:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:27,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:55:27,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:55:27,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:55:27,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:55:27,587 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 05:55:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:27,929 INFO L93 Difference]: Finished difference Result 342 states and 417 transitions. [2021-12-16 05:55:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 05:55:27,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 05:55:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:27,930 INFO L225 Difference]: With dead ends: 342 [2021-12-16 05:55:27,930 INFO L226 Difference]: Without dead ends: 342 [2021-12-16 05:55:27,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:55:27,931 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 200 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:27,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 570 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:55:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-12-16 05:55:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 249. [2021-12-16 05:55:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 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-16 05:55:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2021-12-16 05:55:27,935 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 41 [2021-12-16 05:55:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:27,935 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2021-12-16 05:55:27,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 05:55:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2021-12-16 05:55:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 05:55:27,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:27,935 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:27,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 05:55:27,935 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:55:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2021-12-16 05:55:27,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:55:27,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433311350] [2021-12-16 05:55:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:27,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:55:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:28,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:55:28,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433311350] [2021-12-16 05:55:28,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433311350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:55:28,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:55:28,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-16 05:55:28,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127054618] [2021-12-16 05:55:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:55:28,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-16 05:55:28,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:55:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 05:55:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-12-16 05:55:28,184 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:55:28,824 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2021-12-16 05:55:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 05:55:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-16 05:55:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:55:28,826 INFO L225 Difference]: With dead ends: 285 [2021-12-16 05:55:28,826 INFO L226 Difference]: Without dead ends: 285 [2021-12-16 05:55:28,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-12-16 05:55:28,827 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 177 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:55:28,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 938 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 05:55:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-16 05:55:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 249. [2021-12-16 05:55:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 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-16 05:55:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2021-12-16 05:55:28,832 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 42 [2021-12-16 05:55:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:55:28,832 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2021-12-16 05:55:28,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:55:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2021-12-16 05:55:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 05:55:28,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:55:28,833 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:55:28,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 05:55:28,833 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-16 05:55:28,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:55:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2021-12-16 05:55:28,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:55:28,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829026931] [2021-12-16 05:55:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:28,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:55:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:29,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:55:29,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829026931] [2021-12-16 05:55:29,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829026931] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:55:29,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017363771] [2021-12-16 05:55:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:55:29,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:55:29,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:55:29,121 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-16 05:55:29,142 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-16 05:55:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:55:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-16 05:55:29,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:55:29,283 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-12-16 05:55:29,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 20 treesize of output 14 [2021-12-16 05:55:29,340 INFO L388 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 11 treesize of output 7 [2021-12-16 05:55:29,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:55:29,402 INFO L388 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 19 treesize of output 19 [2021-12-16 05:55:29,502 INFO L388 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-16 05:55:29,668 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:55:29,669 INFO L388 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-16 05:55:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:55:29,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:55:30,203 INFO L388 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 118 treesize of output 100 [2021-12-16 05:55:30,330 INFO L388 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 92 treesize of output 80