./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:40:31,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:40:31,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:40:31,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:40:31,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:40:31,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:40:31,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:40:31,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:40:31,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:40:31,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:40:31,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:40:31,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:40:31,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:40:31,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:40:31,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:40:31,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:40:31,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:40:31,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:40:31,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:40:31,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:40:31,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:40:31,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:40:31,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:40:31,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:40:31,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:40:31,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:40:31,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:40:31,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:40:31,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:40:31,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:40:31,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:40:31,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:40:31,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:40:31,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:40:31,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:40:31,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:40:31,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:40:31,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:40:31,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:40:31,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:40:31,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:40:31,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:40:31,353 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:40:31,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:40:31,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:40:31,353 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:40:31,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:40:31,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:40:31,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:40:31,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:40:31,355 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:40:31,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:40:31,355 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:40:31,356 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:40:31,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:40:31,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:40:31,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:40:31,356 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:40:31,356 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:40:31,357 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:40:31,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:40:31,357 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:40:31,357 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:40:31,357 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:40:31,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:40:31,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:40:31,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:40:31,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:40:31,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:40:31,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:40:31,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:40:31,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:40:31,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:40:31,359 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-14 19:40:31,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:40:31,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:40:31,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:40:31,529 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:40:31,529 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:40:31,530 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-14 19:40:31,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b7aae5e/b44a87b2c45246a7a57abf21a3553b9c/FLAG743af946a [2021-12-14 19:40:31,981 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:40:31,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2021-12-14 19:40:31,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b7aae5e/b44a87b2c45246a7a57abf21a3553b9c/FLAG743af946a [2021-12-14 19:40:31,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b7aae5e/b44a87b2c45246a7a57abf21a3553b9c [2021-12-14 19:40:32,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:40:32,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:40:32,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:40:32,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:40:32,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:40:32,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:40:31" (1/1) ... [2021-12-14 19:40:32,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a14ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32, skipping insertion in model container [2021-12-14 19:40:32,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:40:31" (1/1) ... [2021-12-14 19:40:32,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:40:32,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:40:32,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:40:32,301 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:40:32,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:40:32,368 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:40:32,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32 WrapperNode [2021-12-14 19:40:32,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:40:32,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:40:32,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:40:32,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:40:32,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,421 INFO L137 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2021-12-14 19:40:32,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:40:32,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:40:32,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:40:32,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:40:32,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:40:32,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:40:32,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:40:32,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:40:32,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (1/1) ... [2021-12-14 19:40:32,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:40:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:40:32,511 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-14 19:40:32,523 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-14 19:40:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:40:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:40:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:40:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:40:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:40:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:40:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:40:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:40:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:40:32,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:40:32,597 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:40:32,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:40:32,941 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:40:32,945 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:40:32,947 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 19:40:32,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:32 BoogieIcfgContainer [2021-12-14 19:40:32,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:40:32,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:40:32,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:40:32,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:40:32,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:40:31" (1/3) ... [2021-12-14 19:40:32,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6953fcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:40:32, skipping insertion in model container [2021-12-14 19:40:32,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:32" (2/3) ... [2021-12-14 19:40:32,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6953fcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:40:32, skipping insertion in model container [2021-12-14 19:40:32,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:32" (3/3) ... [2021-12-14 19:40:32,957 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2021-12-14 19:40:32,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:40:32,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-12-14 19:40:33,004 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:40:33,011 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-14 19:40:33,012 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-12-14 19:40:33,026 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-14 19:40:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:40:33,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:40:33,038 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-14 19:40:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,042 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2021-12-14 19:40:33,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692765188] [2021-12-14 19:40:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:33,139 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-14 19:40:33,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692765188] [2021-12-14 19:40:33,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692765188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:33,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:33,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:40:33,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124415561] [2021-12-14 19:40:33,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:33,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 19:40:33,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 19:40:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:40:33,167 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-14 19:40:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:33,190 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2021-12-14 19:40:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:40:33,192 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-14 19:40:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:33,200 INFO L225 Difference]: With dead ends: 151 [2021-12-14 19:40:33,201 INFO L226 Difference]: Without dead ends: 149 [2021-12-14 19:40:33,203 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-14 19:40:33,206 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-14 19:40:33,207 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-14 19:40:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-14 19:40:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-12-14 19:40:33,236 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-14 19:40:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2021-12-14 19:40:33,238 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2021-12-14 19:40:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:33,238 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2021-12-14 19:40:33,239 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-14 19:40:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2021-12-14 19:40:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:40:33,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:33,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:40:33,240 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-14 19:40:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2021-12-14 19:40:33,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205889910] [2021-12-14 19:40:33,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:33,290 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-14 19:40:33,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:33,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205889910] [2021-12-14 19:40:33,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205889910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:33,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:33,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:40:33,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92804597] [2021-12-14 19:40:33,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:33,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:40:33,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:33,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:40:33,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:40:33,296 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-14 19:40:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:33,412 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2021-12-14 19:40:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:40:33,412 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-14 19:40:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:33,414 INFO L225 Difference]: With dead ends: 196 [2021-12-14 19:40:33,415 INFO L226 Difference]: Without dead ends: 195 [2021-12-14 19:40:33,415 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-14 19:40:33,416 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-14 19:40:33,416 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-14 19:40:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-14 19:40:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2021-12-14 19:40:33,424 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-14 19:40:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2021-12-14 19:40:33,427 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2021-12-14 19:40:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:33,427 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2021-12-14 19:40:33,428 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-14 19:40:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2021-12-14 19:40:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:40:33,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:33,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:40:33,430 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-14 19:40:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2021-12-14 19:40:33,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254893720] [2021-12-14 19:40:33,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:33,468 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-14 19:40:33,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:33,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254893720] [2021-12-14 19:40:33,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254893720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:33,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:33,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:40:33,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632151076] [2021-12-14 19:40:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:33,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:40:33,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:40:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:40:33,470 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-14 19:40:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:33,508 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2021-12-14 19:40:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:40:33,508 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-14 19:40:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:33,509 INFO L225 Difference]: With dead ends: 173 [2021-12-14 19:40:33,509 INFO L226 Difference]: Without dead ends: 172 [2021-12-14 19:40:33,509 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-14 19:40:33,510 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-14 19:40:33,511 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-14 19:40:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-14 19:40:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2021-12-14 19:40:33,516 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-14 19:40:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2021-12-14 19:40:33,517 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2021-12-14 19:40:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:33,517 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2021-12-14 19:40:33,517 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-14 19:40:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2021-12-14 19:40:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:40:33,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:33,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:40:33,518 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-14 19:40:33,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2021-12-14 19:40:33,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117561862] [2021-12-14 19:40:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:33,542 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-14 19:40:33,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:33,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117561862] [2021-12-14 19:40:33,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117561862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:33,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:33,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:40:33,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030658419] [2021-12-14 19:40:33,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:33,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:40:33,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:33,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:40:33,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:40:33,545 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-14 19:40:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:33,640 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2021-12-14 19:40:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:40:33,641 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-14 19:40:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:33,642 INFO L225 Difference]: With dead ends: 191 [2021-12-14 19:40:33,642 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 19:40:33,642 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-14 19:40:33,643 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-14 19:40:33,643 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-14 19:40:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 19:40:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-12-14 19:40:33,648 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-14 19:40:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2021-12-14 19:40:33,648 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2021-12-14 19:40:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:33,649 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2021-12-14 19:40:33,649 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-14 19:40:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2021-12-14 19:40:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:40:33,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:33,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:40:33,650 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-14 19:40:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2021-12-14 19:40:33,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514048869] [2021-12-14 19:40:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:33,677 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-14 19:40:33,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:33,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514048869] [2021-12-14 19:40:33,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514048869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:33,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:33,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:40:33,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289129705] [2021-12-14 19:40:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:33,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:40:33,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:33,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:40:33,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:40:33,679 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-14 19:40:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:33,743 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2021-12-14 19:40:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:40:33,744 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-14 19:40:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:33,744 INFO L225 Difference]: With dead ends: 157 [2021-12-14 19:40:33,744 INFO L226 Difference]: Without dead ends: 157 [2021-12-14 19:40:33,745 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-14 19:40:33,746 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-14 19:40:33,746 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-14 19:40:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-14 19:40:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-12-14 19:40:33,749 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-14 19:40:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2021-12-14 19:40:33,750 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2021-12-14 19:40:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:33,750 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2021-12-14 19:40:33,750 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-14 19:40:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2021-12-14 19:40:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:40:33,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:33,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:40:33,751 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-14 19:40:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2021-12-14 19:40:33,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727683331] [2021-12-14 19:40:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:33,780 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-14 19:40:33,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727683331] [2021-12-14 19:40:33,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727683331] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:33,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:33,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:40:33,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150770142] [2021-12-14 19:40:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:33,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:40:33,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:33,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:40:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:40:33,782 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-14 19:40:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:33,805 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2021-12-14 19:40:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:40:33,806 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-14 19:40:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:33,807 INFO L225 Difference]: With dead ends: 295 [2021-12-14 19:40:33,807 INFO L226 Difference]: Without dead ends: 295 [2021-12-14 19:40:33,807 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-14 19:40:33,808 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-14 19:40:33,808 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-14 19:40:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-12-14 19:40:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2021-12-14 19:40:33,811 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-14 19:40:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2021-12-14 19:40:33,812 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2021-12-14 19:40:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:33,812 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2021-12-14 19:40:33,813 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-14 19:40:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2021-12-14 19:40:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:40:33,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:33,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:40:33,813 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-14 19:40:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2021-12-14 19:40:33,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778215440] [2021-12-14 19:40:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:33,864 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-14 19:40:33,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778215440] [2021-12-14 19:40:33,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778215440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:33,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:33,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:40:33,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113225730] [2021-12-14 19:40:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:33,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:40:33,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:40:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:40:33,868 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-14 19:40:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:33,932 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2021-12-14 19:40:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:40:33,934 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-14 19:40:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:33,935 INFO L225 Difference]: With dead ends: 156 [2021-12-14 19:40:33,935 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 19:40:33,935 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-14 19:40:33,937 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-14 19:40:33,938 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-14 19:40:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 19:40:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-14 19:40:33,941 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-14 19:40:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2021-12-14 19:40:33,942 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2021-12-14 19:40:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:33,942 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2021-12-14 19:40:33,943 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-14 19:40:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2021-12-14 19:40:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:40:33,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:33,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:33,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:40:33,944 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-14 19:40:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2021-12-14 19:40:33,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:33,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528057959] [2021-12-14 19:40:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:33,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:34,028 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-14 19:40:34,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:34,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528057959] [2021-12-14 19:40:34,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528057959] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:34,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:34,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:40:34,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984408778] [2021-12-14 19:40:34,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:34,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:40:34,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:34,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:40:34,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:40:34,031 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-14 19:40:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:34,105 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2021-12-14 19:40:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:40:34,105 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-14 19:40:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:34,106 INFO L225 Difference]: With dead ends: 153 [2021-12-14 19:40:34,106 INFO L226 Difference]: Without dead ends: 153 [2021-12-14 19:40:34,107 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-14 19:40:34,107 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 19:40:34,107 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-14 19:40:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-14 19:40:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-14 19:40:34,110 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-14 19:40:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2021-12-14 19:40:34,112 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2021-12-14 19:40:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:34,128 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2021-12-14 19:40:34,128 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-14 19:40:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2021-12-14 19:40:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:40:34,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:34,129 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-14 19:40:34,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:40:34,132 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-14 19:40:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2021-12-14 19:40:34,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:34,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166574080] [2021-12-14 19:40:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:34,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:34,222 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-14 19:40:34,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:34,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166574080] [2021-12-14 19:40:34,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166574080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:34,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:34,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:40:34,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948399413] [2021-12-14 19:40:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:34,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:40:34,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:34,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:40:34,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:40:34,224 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-14 19:40:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:34,342 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2021-12-14 19:40:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:40:34,342 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-14 19:40:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:34,343 INFO L225 Difference]: With dead ends: 261 [2021-12-14 19:40:34,343 INFO L226 Difference]: Without dead ends: 261 [2021-12-14 19:40:34,343 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-14 19:40:34,345 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-14 19:40:34,346 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-14 19:40:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-14 19:40:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2021-12-14 19:40:34,348 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-14 19:40:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2021-12-14 19:40:34,349 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2021-12-14 19:40:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:34,349 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2021-12-14 19:40:34,349 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-14 19:40:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2021-12-14 19:40:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:40:34,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:34,350 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-14 19:40:34,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:40:34,350 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-14 19:40:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2021-12-14 19:40:34,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:34,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946849167] [2021-12-14 19:40:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:34,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:34,447 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-14 19:40:34,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:34,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946849167] [2021-12-14 19:40:34,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946849167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:34,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:34,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:40:34,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756091529] [2021-12-14 19:40:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:34,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:40:34,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:40:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:40:34,449 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-14 19:40:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:34,553 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2021-12-14 19:40:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:40:34,554 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-14 19:40:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:34,554 INFO L225 Difference]: With dead ends: 147 [2021-12-14 19:40:34,555 INFO L226 Difference]: Without dead ends: 147 [2021-12-14 19:40:34,555 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-14 19:40:34,555 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-14 19:40:34,555 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-14 19:40:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-14 19:40:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2021-12-14 19:40:34,557 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-14 19:40:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2021-12-14 19:40:34,558 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2021-12-14 19:40:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:34,558 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2021-12-14 19:40:34,558 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-14 19:40:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2021-12-14 19:40:34,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:40:34,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:34,559 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-14 19:40:34,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:40:34,559 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-14 19:40:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2021-12-14 19:40:34,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:34,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017002979] [2021-12-14 19:40:34,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:34,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:34,632 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-14 19:40:34,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017002979] [2021-12-14 19:40:34,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017002979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:34,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:34,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:40:34,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528080346] [2021-12-14 19:40:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:34,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:40:34,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:34,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:40:34,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:40:34,636 INFO L87 Difference]: Start difference. First operand 146 states and 164 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-14 19:40:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:35,198 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2021-12-14 19:40:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:40:35,199 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-14 19:40:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:35,200 INFO L225 Difference]: With dead ends: 239 [2021-12-14 19:40:35,200 INFO L226 Difference]: Without dead ends: 239 [2021-12-14 19:40:35,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:40:35,200 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 325 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:35,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 226 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:40:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-14 19:40:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2021-12-14 19:40:35,203 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-14 19:40:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2021-12-14 19:40:35,203 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2021-12-14 19:40:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:35,204 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2021-12-14 19:40:35,204 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-14 19:40:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2021-12-14 19:40:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:40:35,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:35,205 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-14 19:40:35,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:40:35,205 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-14 19:40:35,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2021-12-14 19:40:35,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:35,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020043479] [2021-12-14 19:40:35,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:35,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:35,271 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-14 19:40:35,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:35,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020043479] [2021-12-14 19:40:35,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020043479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:35,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:35,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:40:35,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901137491] [2021-12-14 19:40:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:35,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:40:35,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:40:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:40:35,288 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-14 19:40:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:35,369 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2021-12-14 19:40:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:40:35,370 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-14 19:40:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:35,371 INFO L225 Difference]: With dead ends: 238 [2021-12-14 19:40:35,371 INFO L226 Difference]: Without dead ends: 238 [2021-12-14 19:40:35,371 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-14 19:40:35,372 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-14 19:40:35,372 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-14 19:40:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-14 19:40:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2021-12-14 19:40:35,375 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-14 19:40:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2021-12-14 19:40:35,375 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2021-12-14 19:40:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:35,375 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2021-12-14 19:40:35,376 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-14 19:40:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2021-12-14 19:40:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:40:35,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:35,376 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-14 19:40:35,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:40:35,377 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-14 19:40:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2021-12-14 19:40:35,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:35,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758079271] [2021-12-14 19:40:35,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:35,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:35,432 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-14 19:40:35,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:35,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758079271] [2021-12-14 19:40:35,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758079271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:35,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:35,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:40:35,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305802146] [2021-12-14 19:40:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:35,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:40:35,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:40:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:40:35,434 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-14 19:40:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:35,591 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2021-12-14 19:40:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:40:35,591 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-14 19:40:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:35,592 INFO L225 Difference]: With dead ends: 213 [2021-12-14 19:40:35,592 INFO L226 Difference]: Without dead ends: 213 [2021-12-14 19:40:35,592 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-14 19:40:35,593 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 19 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:35,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 396 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:40:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-14 19:40:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2021-12-14 19:40:35,595 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-14 19:40:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2021-12-14 19:40:35,596 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2021-12-14 19:40:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:35,596 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2021-12-14 19:40:35,596 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-14 19:40:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2021-12-14 19:40:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:40:35,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:35,598 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-14 19:40:35,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:40:35,598 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-14 19:40:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2021-12-14 19:40:35,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:35,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105902854] [2021-12-14 19:40:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:35,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:35,659 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-14 19:40:35,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:35,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105902854] [2021-12-14 19:40:35,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105902854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:35,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:35,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:40:35,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308403595] [2021-12-14 19:40:35,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:35,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:40:35,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:35,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:40:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:40:35,661 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-14 19:40:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:35,762 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2021-12-14 19:40:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:40:35,762 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-14 19:40:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:35,763 INFO L225 Difference]: With dead ends: 225 [2021-12-14 19:40:35,763 INFO L226 Difference]: Without dead ends: 225 [2021-12-14 19:40:35,763 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-14 19:40:35,780 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:35,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 455 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:40:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-14 19:40:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2021-12-14 19:40:35,783 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-14 19:40:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2021-12-14 19:40:35,784 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2021-12-14 19:40:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:35,784 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2021-12-14 19:40:35,784 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-14 19:40:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2021-12-14 19:40:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:40:35,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:35,785 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-14 19:40:35,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:40:35,785 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-14 19:40:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2021-12-14 19:40:35,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:35,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971721515] [2021-12-14 19:40:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:35,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:35,989 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-14 19:40:35,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:35,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971721515] [2021-12-14 19:40:35,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971721515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:35,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:35,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:40:35,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499175649] [2021-12-14 19:40:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:35,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:40:35,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:40:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:40:35,992 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-14 19:40:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:36,405 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2021-12-14 19:40:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:40:36,406 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-14 19:40:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:36,408 INFO L225 Difference]: With dead ends: 307 [2021-12-14 19:40:36,408 INFO L226 Difference]: Without dead ends: 307 [2021-12-14 19:40:36,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:40:36,410 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 169 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:36,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 447 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:40:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-14 19:40:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2021-12-14 19:40:36,414 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-14 19:40:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2021-12-14 19:40:36,414 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2021-12-14 19:40:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:36,415 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2021-12-14 19:40:36,415 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-14 19:40:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2021-12-14 19:40:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:40:36,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:36,419 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-14 19:40:36,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:40:36,419 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-14 19:40:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2021-12-14 19:40:36,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:36,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062457655] [2021-12-14 19:40:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:36,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:36,608 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-14 19:40:36,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:36,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062457655] [2021-12-14 19:40:36,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062457655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:36,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:36,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:40:36,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48188273] [2021-12-14 19:40:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:36,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:40:36,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:40:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:40:36,611 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-14 19:40:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:36,961 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2021-12-14 19:40:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:40:36,961 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-14 19:40:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:36,962 INFO L225 Difference]: With dead ends: 309 [2021-12-14 19:40:36,962 INFO L226 Difference]: Without dead ends: 309 [2021-12-14 19:40:36,962 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-14 19:40:36,963 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 170 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:36,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 479 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:40:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-12-14 19:40:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2021-12-14 19:40:36,965 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-14 19:40:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2021-12-14 19:40:36,966 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2021-12-14 19:40:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:36,966 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2021-12-14 19:40:36,966 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-14 19:40:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2021-12-14 19:40:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:40:36,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:36,966 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-14 19:40:36,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:40:36,966 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-14 19:40:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2021-12-14 19:40:36,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:36,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799436649] [2021-12-14 19:40:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:36,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:37,042 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-14 19:40:37,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799436649] [2021-12-14 19:40:37,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799436649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:37,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:37,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:40:37,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904601866] [2021-12-14 19:40:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:37,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:40:37,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:40:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:40:37,044 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-14 19:40:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:37,207 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2021-12-14 19:40:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:40:37,207 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-14 19:40:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:37,208 INFO L225 Difference]: With dead ends: 254 [2021-12-14 19:40:37,208 INFO L226 Difference]: Without dead ends: 254 [2021-12-14 19:40:37,208 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-14 19:40:37,208 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:37,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 657 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:40:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-14 19:40:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2021-12-14 19:40:37,211 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-14 19:40:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2021-12-14 19:40:37,211 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2021-12-14 19:40:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:37,211 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2021-12-14 19:40:37,212 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-14 19:40:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2021-12-14 19:40:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:40:37,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:37,212 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-14 19:40:37,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:40:37,212 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-14 19:40:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2021-12-14 19:40:37,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:37,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202879498] [2021-12-14 19:40:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:37,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:37,256 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-14 19:40:37,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:37,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202879498] [2021-12-14 19:40:37,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202879498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:37,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:37,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:40:37,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590130301] [2021-12-14 19:40:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:37,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:40:37,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:37,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:40:37,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:40:37,258 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-14 19:40:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:37,394 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2021-12-14 19:40:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:40:37,394 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-14 19:40:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:37,395 INFO L225 Difference]: With dead ends: 299 [2021-12-14 19:40:37,395 INFO L226 Difference]: Without dead ends: 299 [2021-12-14 19:40:37,395 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-14 19:40:37,396 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-14 19:40:37,396 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-14 19:40:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-14 19:40:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2021-12-14 19:40:37,399 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-14 19:40:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2021-12-14 19:40:37,400 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2021-12-14 19:40:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:37,400 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2021-12-14 19:40:37,400 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-14 19:40:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-12-14 19:40:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:40:37,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:37,400 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-14 19:40:37,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:40:37,401 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-14 19:40:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2021-12-14 19:40:37,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:37,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671566137] [2021-12-14 19:40:37,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:37,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:37,583 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-14 19:40:37,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:37,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671566137] [2021-12-14 19:40:37,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671566137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:37,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:37,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:40:37,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84548013] [2021-12-14 19:40:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:37,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:40:37,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:40:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:40:37,585 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-14 19:40:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:38,051 INFO L93 Difference]: Finished difference Result 328 states and 402 transitions. [2021-12-14 19:40:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:40:38,051 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-14 19:40:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:38,052 INFO L225 Difference]: With dead ends: 328 [2021-12-14 19:40:38,053 INFO L226 Difference]: Without dead ends: 328 [2021-12-14 19:40:38,053 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-14 19:40:38,053 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 208 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:38,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 396 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:40:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-12-14 19:40:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2021-12-14 19:40:38,057 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-14 19:40:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2021-12-14 19:40:38,057 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 34 [2021-12-14 19:40:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:38,058 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2021-12-14 19:40:38,058 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-14 19:40:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2021-12-14 19:40:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:40:38,058 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:38,059 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-14 19:40:38,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:40:38,059 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-14 19:40:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2021-12-14 19:40:38,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:38,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312674645] [2021-12-14 19:40:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:38,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:38,265 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-14 19:40:38,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:38,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312674645] [2021-12-14 19:40:38,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312674645] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:40:38,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786007919] [2021-12-14 19:40:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:38,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:40:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:40:38,267 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-14 19:40:38,290 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-14 19:40:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:38,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-14 19:40:38,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:38,457 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-14 19:40:38,461 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-14 19:40:38,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:38,498 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-14 19:40:38,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:38,504 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-14 19:40:38,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:38,526 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-14 19:40:38,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:38,530 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-14 19:40:38,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:38,551 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-14 19:40:38,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:38,557 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-14 19:40:38,608 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:40:38,608 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-14 19:40:38,615 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-14 19:40:38,630 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:40:38,630 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-14 19:40:38,637 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-14 19:40:38,735 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-14 19:40:38,738 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-14 19:40:39,079 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-14 19:40:39,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:40:39,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:39,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:40:39,585 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:40:39,585 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-14 19:40:39,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:39,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:40:39,598 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:40:39,600 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-14 19:40:39,606 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:40:39,607 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-14 19:40:39,656 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-14 19:40:39,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:40:39,714 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-14 19:40:41,547 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 ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.base|))) (.cse4 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) .cse4))) (or (= .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| (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 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|) .cse4))) (and (= (select (select .cse1 .cse0) .cse2) 0) (= (select (select .cse3 .cse0) .cse2) 0)))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|)))))) is different from false [2021-12-14 19:40:42,937 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 ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select .cse1 .cse4))) (or (= |c_ULTIMATE.start_main_~lItem~0#1.base| .cse0) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (let ((.cse3 (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 .cse3 .cse4))) (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse1) .cse0) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse3) .cse0) .cse2) 0))))))))) is different from false [2021-12-14 19:40:42,979 INFO L354 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2021-12-14 19:40:42,980 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 141 treesize of output 145 [2021-12-14 19:40:42,999 INFO L354 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2021-12-14 19:40:42,999 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 253 treesize of output 234 [2021-12-14 19:40:44,727 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:44,732 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-14 19:40:44,829 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:44,829 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-14 19:40:44,906 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:44,907 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-14 19:40:44,981 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:44,982 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-14 19:40:45,117 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:45,118 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-14 19:40:45,396 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:45,396 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-14 19:40:45,536 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))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 .cse4))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 .cse4) |c_ULTIMATE.start_main_~item~0#1.offset|))))) is different from false [2021-12-14 19:40:45,571 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:45,571 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-14 19:40:45,631 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:45,631 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-14 19:40:45,729 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:45,729 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-14 19:40:45,933 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:45,933 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-14 19:40:46,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,103 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-14 19:40:46,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,145 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-14 19:40:46,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,183 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-14 19:40:46,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,211 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-14 19:40:46,240 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))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) is different from false [2021-12-14 19:40:46,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,281 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-14 19:40:46,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,301 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-14 19:40:46,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,403 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-14 19:40:46,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,426 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-14 19:40:46,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,525 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-14 19:40:46,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,558 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-14 19:40:46,624 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))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse2) (select v_arrayElimArr_1 .cse3)) 0)))))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) is different from false [2021-12-14 19:40:46,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,657 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-14 19:40:46,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,681 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-14 19:40:46,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,789 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-14 19:40:46,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,835 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-14 19:40:46,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,934 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-14 19:40:46,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:46,956 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-14 19:40:47,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,043 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-14 19:40:47,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,074 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-14 19:40:47,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,166 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-14 19:40:47,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,191 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-14 19:40:47,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,292 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-14 19:40:47,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,324 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-14 19:40:47,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,418 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-14 19:40:47,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,444 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-14 19:40:47,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,549 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-14 19:40:47,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,576 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-14 19:40:47,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,655 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-14 19:40:47,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,677 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-14 19:40:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,771 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-14 19:40:47,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:47,800 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-14 19:40:47,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:40:47,875 INFO L354 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2021-12-14 19:40:47,875 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 87 treesize of output 1 [2021-12-14 19:40:47,882 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-14 19:40:47,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786007919] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:40:47,883 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:40:47,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2021-12-14 19:40:47,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473090331] [2021-12-14 19:40:47,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:40:47,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-14 19:40:47,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-14 19:40:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1010, Unknown=5, NotChecked=340, Total=1482 [2021-12-14 19:40:47,885 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-14 19:40:47,923 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_~c1~0#1|) (= (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))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse2) (select v_arrayElimArr_1 .cse3)) 0)))))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1)) is different from false [2021-12-14 19:40:47,928 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 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) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1)) is different from false [2021-12-14 19:40:47,931 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base|)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 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))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 .cse4))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 .cse4) |c_ULTIMATE.start_main_~item~0#1.offset|))))) (= (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-14 19:40:49,572 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 (or .cse0 (= (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) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse5 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse1 (select .cse2 .cse5))) (or (= |c_ULTIMATE.start_main_~lItem~0#1.base| .cse1) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (let ((.cse4 (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 .cse4 .cse5))) (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse2) .cse1) .cse3) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse4) .cse1) .cse3) 0))))))))) (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)) (not .cse0) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) is different from false [2021-12-14 19:40:51,006 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 (or .cse0 (= (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_~data~0#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (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)) (= 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (not .cse0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.base|))) (.cse5 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~data~0#1.base|) .cse5))) (or (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| (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 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) .cse5))) (and (= (select (select .cse2 .cse1) .cse3) 0) (= (select (select .cse4 .cse1) .cse3) 0)))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) is different from false [2021-12-14 19:40:51,176 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) .cse6)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse6))) (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~data~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) (or (= .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) (< 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) 0))) (<= 6 (select (select |c_#memory_int| .cse0) 4)) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse5 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse4 (select v_arrayElimArr_2 .cse5))) (or (= .cse4 |ULTIMATE.start_main_~lItem~0#1.base|) (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse4) (select v_arrayElimArr_1 .cse5)) 0)))))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= 0 .cse1)))) is different from false [2021-12-14 19:40:51,186 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 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))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= (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|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse2) (select v_arrayElimArr_1 .cse3)) 0)))))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (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-14 19:40:51,457 WARN L838 $PredicateComparison]: unable to prove that (and (= |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))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 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) (= (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-14 19:40:51,503 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 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))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 .cse4))) (< |ULTIMATE.start_main_~data~0#1.offset| 0) (< 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select v_arrayElimArr_1 .cse4) |c_ULTIMATE.start_main_~item~0#1.offset|))))) (= (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-14 19:40:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:51,992 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2021-12-14 19:40:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-14 19:40:51,993 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-14 19:40:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:51,993 INFO L225 Difference]: With dead ends: 258 [2021-12-14 19:40:51,993 INFO L226 Difference]: Without dead ends: 258 [2021-12-14 19:40:51,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=262, Invalid=1850, Unknown=14, NotChecked=1414, Total=3540 [2021-12-14 19:40:51,998 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 148 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:51,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 1754 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 941 Invalid, 0 Unknown, 587 Unchecked, 0.5s Time] [2021-12-14 19:40:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-14 19:40:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2021-12-14 19:40:52,004 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-14 19:40:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2021-12-14 19:40:52,005 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 39 [2021-12-14 19:40:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:52,005 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2021-12-14 19:40:52,005 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-14 19:40:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2021-12-14 19:40:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:40:52,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:52,006 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-14 19:40:52,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:40:52,223 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-14 19:40:52,223 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-14 19:40:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2021-12-14 19:40:52,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:52,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611135565] [2021-12-14 19:40:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:52,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:52,365 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-14 19:40:52,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:52,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611135565] [2021-12-14 19:40:52,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611135565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:52,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:52,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:40:52,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730443941] [2021-12-14 19:40:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:52,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:40:52,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:40:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:40:52,369 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-14 19:40:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:52,654 INFO L93 Difference]: Finished difference Result 342 states and 417 transitions. [2021-12-14 19:40:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:40:52,655 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-14 19:40:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:52,656 INFO L225 Difference]: With dead ends: 342 [2021-12-14 19:40:52,656 INFO L226 Difference]: Without dead ends: 342 [2021-12-14 19:40:52,656 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-14 19:40:52,656 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 214 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:52,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 455 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:40:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-12-14 19:40:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 249. [2021-12-14 19:40:52,659 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-14 19:40:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2021-12-14 19:40:52,660 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 41 [2021-12-14 19:40:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:52,660 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2021-12-14 19:40:52,660 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-14 19:40:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2021-12-14 19:40:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:40:52,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:52,660 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-14 19:40:52,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:40:52,661 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-14 19:40:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2021-12-14 19:40:52,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:52,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552075363] [2021-12-14 19:40:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:52,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:52,982 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-14 19:40:52,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:52,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552075363] [2021-12-14 19:40:52,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552075363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:52,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:52,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-14 19:40:52,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497197744] [2021-12-14 19:40:52,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:52,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 19:40:52,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:40:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 19:40:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:40:52,984 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-14 19:40:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:53,707 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2021-12-14 19:40:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:40:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-14 19:40:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:53,710 INFO L225 Difference]: With dead ends: 285 [2021-12-14 19:40:53,710 INFO L226 Difference]: Without dead ends: 285 [2021-12-14 19:40:53,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 19:40:53,711 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 175 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:53,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 1054 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:40:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-14 19:40:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 249. [2021-12-14 19:40:53,723 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-14 19:40:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2021-12-14 19:40:53,724 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 42 [2021-12-14 19:40:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:53,724 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2021-12-14 19:40:53,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-14 19:40:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2021-12-14 19:40:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:40:53,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:53,725 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-14 19:40:53,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 19:40:53,725 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-14 19:40:53,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2021-12-14 19:40:53,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:40:53,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173304927] [2021-12-14 19:40:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:53,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:40:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:54,154 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-14 19:40:54,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:40:54,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173304927] [2021-12-14 19:40:54,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173304927] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:40:54,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041932160] [2021-12-14 19:40:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:54,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:40:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:40:54,156 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-14 19:40:54,157 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-14 19:40:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:54,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-14 19:40:54,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:54,347 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-12-14 19:40:54,347 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-14 19:40:54,402 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-14 19:40:54,470 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:40:54,470 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-14 19:40:54,572 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-14 19:40:54,688 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:40:54,689 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:40:54,723 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-14 19:40:54,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:40:55,054 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 68 treesize of output 56 [2021-12-14 19:40:55,133 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 42 treesize of output 36