./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-3.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 79c869b9530d3ec4745fdd0d6c1ca37b23d5c5fc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:25:43,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:25:43,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:25:43,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:25:43,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:25:43,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:25:43,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:25:43,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:25:43,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:25:43,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:25:43,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:25:43,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:25:43,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:25:43,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:25:43,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:25:43,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:25:43,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:25:43,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:25:43,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:25:43,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:25:43,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:25:43,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:25:43,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:25:43,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:25:43,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:25:43,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:25:43,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:25:43,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:25:43,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:25:43,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:25:43,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:25:43,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:25:43,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:25:43,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:25:43,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:25:43,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:25:43,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:25:43,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:25:43,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:25:43,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:25:43,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:25:43,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 05:25:43,508 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:25:43,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:25:43,509 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:25:43,509 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:25:43,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:25:43,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:25:43,511 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:25:43,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:25:43,511 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:25:43,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:25:43,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:25:43,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:25:43,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:25:43,513 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:25:43,513 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:25:43,513 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:25:43,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:25:43,513 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:25:43,513 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:25:43,514 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:25:43,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:25:43,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:25:43,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:25:43,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:25:43,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:25:43,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:25:43,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 05:25:43,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 05:25:43,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:25:43,515 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 -> 79c869b9530d3ec4745fdd0d6c1ca37b23d5c5fc [2021-08-27 05:25:43,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:25:43,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:25:43,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:25:43,812 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:25:43,812 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:25:43,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-3.i [2021-08-27 05:25:43,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37216a546/84bba933e3634c15954b7744a7e67553/FLAGb8d462594 [2021-08-27 05:25:44,245 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:25:44,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2021-08-27 05:25:44,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37216a546/84bba933e3634c15954b7744a7e67553/FLAGb8d462594 [2021-08-27 05:25:44,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37216a546/84bba933e3634c15954b7744a7e67553 [2021-08-27 05:25:44,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:25:44,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:25:44,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:25:44,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:25:44,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:25:44,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:44,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e5395f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44, skipping insertion in model container [2021-08-27 05:25:44,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:44,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:25:44,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:25:44,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:25:44,937 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:25:44,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:25:44,976 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:25:44,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44 WrapperNode [2021-08-27 05:25:44,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:25:44,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:25:44,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:25:44,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:25:44,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:44,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:44,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:44,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:45,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:45,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:45,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:45,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:25:45,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:25:45,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:25:45,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:25:45,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (1/1) ... [2021-08-27 05:25:45,017 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:25:45,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:25:45,032 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-08-27 05:25:45,049 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-08-27 05:25:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:25:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:25:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:25:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:25:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:25:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:25:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:25:45,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:25:45,066 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2021-08-27 05:25:45,066 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:25:45,066 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:25:45,066 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:25:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:25:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:25:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:25:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:25:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:25:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:25:45,067 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:25:45,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:25:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:25:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:25:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:25:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:25:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:25:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:25:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:25:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:25:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:25:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:25:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:25:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:25:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:25:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:25:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:25:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:25:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:25:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:25:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:25:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:25:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:25:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:25:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:25:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:25:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:25:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:25:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:25:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:25:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:25:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:25:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:25:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:25:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:25:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:25:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:25:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:25:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:25:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:25:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:25:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:25:45,076 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:25:45,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:25:45,076 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:25:45,077 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:25:45,077 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:25:45,077 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:25:45,077 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:25:45,077 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:25:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:25:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:25:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:25:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:25:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:25:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:25:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:25:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:25:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:25:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:25:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:25:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:25:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:25:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure append [2021-08-27 05:25:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:25:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:25:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:25:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:25:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 05:25:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:25:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:25:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 05:25:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:25:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 05:25:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 05:25:45,539 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:25:45,540 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 05:25:45,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:25:45 BoogieIcfgContainer [2021-08-27 05:25:45,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:25:45,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:25:45,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:25:45,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:25:45,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:25:44" (1/3) ... [2021-08-27 05:25:45,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d89af16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:25:45, skipping insertion in model container [2021-08-27 05:25:45,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:25:44" (2/3) ... [2021-08-27 05:25:45,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d89af16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:25:45, skipping insertion in model container [2021-08-27 05:25:45,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:25:45" (3/3) ... [2021-08-27 05:25:45,546 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2021-08-27 05:25:45,550 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:25:45,550 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2021-08-27 05:25:45,576 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:25:45,585 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, mConcurrency=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-08-27 05:25:45,585 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2021-08-27 05:25:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 53 states have (on average 2.150943396226415) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:25:45,603 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:45,603 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:45,603 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1500158253, now seen corresponding path program 1 times [2021-08-27 05:25:45,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:45,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620654898] [2021-08-27 05:25:45,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:45,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:45,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:45,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620654898] [2021-08-27 05:25:45,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620654898] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:45,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:45,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:25:45,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136992664] [2021-08-27 05:25:45,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:25:45,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:25:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:25:45,833 INFO L87 Difference]: Start difference. First operand has 114 states, 53 states have (on average 2.150943396226415) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:46,011 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2021-08-27 05:25:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:25:46,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2021-08-27 05:25:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:46,019 INFO L225 Difference]: With dead ends: 114 [2021-08-27 05:25:46,019 INFO L226 Difference]: Without dead ends: 111 [2021-08-27 05:25:46,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:25:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-08-27 05:25:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-08-27 05:25:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 51 states have (on average 2.156862745098039) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2021-08-27 05:25:46,056 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 8 [2021-08-27 05:25:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:46,056 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2021-08-27 05:25:46,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2021-08-27 05:25:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:25:46,057 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:46,057 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:46,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 05:25:46,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting appendErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash -739601476, now seen corresponding path program 1 times [2021-08-27 05:25:46,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:46,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956534460] [2021-08-27 05:25:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:46,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:46,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:46,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956534460] [2021-08-27 05:25:46,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956534460] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:46,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:46,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:25:46,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936534158] [2021-08-27 05:25:46,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:25:46,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:46,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:25:46,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:25:46,133 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:46,331 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2021-08-27 05:25:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:25:46,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:25:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:46,332 INFO L225 Difference]: With dead ends: 105 [2021-08-27 05:25:46,333 INFO L226 Difference]: Without dead ends: 105 [2021-08-27 05:25:46,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 43.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-27 05:25:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-08-27 05:25:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 52 states have (on average 2.0) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2021-08-27 05:25:46,338 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 9 [2021-08-27 05:25:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:46,339 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2021-08-27 05:25:46,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2021-08-27 05:25:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:25:46,339 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:46,339 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:46,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 05:25:46,340 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash -739601475, now seen corresponding path program 1 times [2021-08-27 05:25:46,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:46,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76750103] [2021-08-27 05:25:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:46,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:46,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:46,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76750103] [2021-08-27 05:25:46,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76750103] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:46,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:46,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:25:46,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944502762] [2021-08-27 05:25:46,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:25:46,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:25:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:25:46,419 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:46,641 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2021-08-27 05:25:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:46,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:25:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:46,644 INFO L225 Difference]: With dead ends: 133 [2021-08-27 05:25:46,644 INFO L226 Difference]: Without dead ends: 133 [2021-08-27 05:25:46,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-27 05:25:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2021-08-27 05:25:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 105 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2021-08-27 05:25:46,649 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 9 [2021-08-27 05:25:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:46,650 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2021-08-27 05:25:46,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2021-08-27 05:25:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:25:46,650 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:46,650 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:46,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 05:25:46,651 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1452809171, now seen corresponding path program 1 times [2021-08-27 05:25:46,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:46,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455260359] [2021-08-27 05:25:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:46,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:46,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:46,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455260359] [2021-08-27 05:25:46,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455260359] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:46,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:46,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:25:46,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643246088] [2021-08-27 05:25:46,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:25:46,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:46,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:25:46,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:25:46,692 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:46,803 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2021-08-27 05:25:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:25:46,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 05:25:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:46,805 INFO L225 Difference]: With dead ends: 107 [2021-08-27 05:25:46,805 INFO L226 Difference]: Without dead ends: 107 [2021-08-27 05:25:46,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:25:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-27 05:25:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-08-27 05:25:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 101 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2021-08-27 05:25:46,809 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 10 [2021-08-27 05:25:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:46,809 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2021-08-27 05:25:46,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2021-08-27 05:25:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:25:46,810 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:46,810 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:46,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 05:25:46,810 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1452809170, now seen corresponding path program 1 times [2021-08-27 05:25:46,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:46,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709716771] [2021-08-27 05:25:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:46,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:46,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:46,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709716771] [2021-08-27 05:25:46,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709716771] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:46,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:46,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:25:46,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991317163] [2021-08-27 05:25:46,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:25:46,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:46,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:25:46,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:25:46,854 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:46,958 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2021-08-27 05:25:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:25:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 05:25:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:46,959 INFO L225 Difference]: With dead ends: 103 [2021-08-27 05:25:46,960 INFO L226 Difference]: Without dead ends: 103 [2021-08-27 05:25:46,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:25:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-27 05:25:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-08-27 05:25:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 97 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2021-08-27 05:25:46,964 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 10 [2021-08-27 05:25:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:46,964 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2021-08-27 05:25:46,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2021-08-27 05:25:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 05:25:46,965 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:46,965 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:46,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 05:25:46,965 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:46,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2099912409, now seen corresponding path program 1 times [2021-08-27 05:25:46,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:46,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336530905] [2021-08-27 05:25:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:46,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:47,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:47,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336530905] [2021-08-27 05:25:47,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336530905] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:47,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:47,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:25:47,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490843328] [2021-08-27 05:25:47,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:25:47,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:25:47,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:25:47,068 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:47,297 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-08-27 05:25:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 05:25:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 05:25:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:47,298 INFO L225 Difference]: With dead ends: 114 [2021-08-27 05:25:47,299 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 05:25:47,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 130.4ms TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:25:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 05:25:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2021-08-27 05:25:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 103 states have internal predecessors, (113), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-08-27 05:25:47,304 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 15 [2021-08-27 05:25:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:47,304 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-08-27 05:25:47,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-08-27 05:25:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 05:25:47,304 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:47,305 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:47,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 05:25:47,305 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash -672497070, now seen corresponding path program 1 times [2021-08-27 05:25:47,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:47,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882169554] [2021-08-27 05:25:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:47,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:47,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:47,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882169554] [2021-08-27 05:25:47,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882169554] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:47,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:47,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:25:47,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600613099] [2021-08-27 05:25:47,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:25:47,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:47,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:25:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:47,383 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:47,527 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2021-08-27 05:25:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:47,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 05:25:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:47,528 INFO L225 Difference]: With dead ends: 109 [2021-08-27 05:25:47,528 INFO L226 Difference]: Without dead ends: 109 [2021-08-27 05:25:47,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:25:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-27 05:25:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2021-08-27 05:25:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 99 states have internal predecessors, (109), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-08-27 05:25:47,532 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 16 [2021-08-27 05:25:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:47,532 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-08-27 05:25:47,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:25:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-08-27 05:25:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 05:25:47,533 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:47,533 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:47,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 05:25:47,533 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:47,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash 685617470, now seen corresponding path program 1 times [2021-08-27 05:25:47,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:47,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239380305] [2021-08-27 05:25:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:47,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:47,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:47,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239380305] [2021-08-27 05:25:47,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239380305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:47,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:47,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:25:47,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817627402] [2021-08-27 05:25:47,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:25:47,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:47,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:25:47,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:25:47,633 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:47,875 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-08-27 05:25:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:25:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-08-27 05:25:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:47,877 INFO L225 Difference]: With dead ends: 123 [2021-08-27 05:25:47,877 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 05:25:47,877 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 91.0ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:25:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 05:25:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2021-08-27 05:25:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 98 states have internal predecessors, (108), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-08-27 05:25:47,887 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 24 [2021-08-27 05:25:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:47,888 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-08-27 05:25:47,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-08-27 05:25:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 05:25:47,889 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:47,889 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:47,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 05:25:47,889 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:47,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:47,890 INFO L82 PathProgramCache]: Analyzing trace with hash 685617471, now seen corresponding path program 1 times [2021-08-27 05:25:47,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:47,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428161015] [2021-08-27 05:25:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:47,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:47,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:48,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:48,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428161015] [2021-08-27 05:25:48,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428161015] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:48,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:48,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:25:48,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46025625] [2021-08-27 05:25:48,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:25:48,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:25:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:25:48,104 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:48,459 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2021-08-27 05:25:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:25:48,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-08-27 05:25:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:48,461 INFO L225 Difference]: With dead ends: 128 [2021-08-27 05:25:48,461 INFO L226 Difference]: Without dead ends: 128 [2021-08-27 05:25:48,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 156.0ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:25:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-27 05:25:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2021-08-27 05:25:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 66 states have (on average 1.621212121212121) internal successors, (107), 97 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-08-27 05:25:48,463 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 24 [2021-08-27 05:25:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:48,464 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-08-27 05:25:48,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-08-27 05:25:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 05:25:48,465 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:48,465 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:48,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 05:25:48,465 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:48,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:48,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1780011878, now seen corresponding path program 1 times [2021-08-27 05:25:48,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:48,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344141737] [2021-08-27 05:25:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:48,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:48,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:48,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:48,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344141737] [2021-08-27 05:25:48,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344141737] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:48,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:48,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:25:48,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095389396] [2021-08-27 05:25:48,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:25:48,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:25:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:25:48,535 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:48,697 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2021-08-27 05:25:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:25:48,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-08-27 05:25:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:48,698 INFO L225 Difference]: With dead ends: 99 [2021-08-27 05:25:48,698 INFO L226 Difference]: Without dead ends: 99 [2021-08-27 05:25:48,699 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.8ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:25:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-27 05:25:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-08-27 05:25:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 91 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2021-08-27 05:25:48,701 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 26 [2021-08-27 05:25:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:48,701 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2021-08-27 05:25:48,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2021-08-27 05:25:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 05:25:48,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:48,702 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:48,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 05:25:48,703 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr40ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:48,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1780011234, now seen corresponding path program 1 times [2021-08-27 05:25:48,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:48,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364425032] [2021-08-27 05:25:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:48,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:48,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:48,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364425032] [2021-08-27 05:25:48,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364425032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:48,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:48,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:25:48,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640873208] [2021-08-27 05:25:48,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:25:48,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:25:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:48,778 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:48,982 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-08-27 05:25:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:25:48,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-08-27 05:25:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:48,983 INFO L225 Difference]: With dead ends: 96 [2021-08-27 05:25:48,984 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 05:25:48,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:25:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 05:25:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-08-27 05:25:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 89 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-08-27 05:25:48,986 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 26 [2021-08-27 05:25:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:48,986 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-08-27 05:25:48,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-08-27 05:25:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 05:25:48,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:48,987 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:48,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 05:25:48,988 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1634399054, now seen corresponding path program 1 times [2021-08-27 05:25:48,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:48,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253221955] [2021-08-27 05:25:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:48,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:49,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:49,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253221955] [2021-08-27 05:25:49,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253221955] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:49,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:49,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:25:49,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388062251] [2021-08-27 05:25:49,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:25:49,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:25:49,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:25:49,100 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:49,344 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2021-08-27 05:25:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:25:49,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-08-27 05:25:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:49,345 INFO L225 Difference]: With dead ends: 95 [2021-08-27 05:25:49,345 INFO L226 Difference]: Without dead ends: 95 [2021-08-27 05:25:49,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 105.9ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:25:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-27 05:25:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-08-27 05:25:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.603448275862069) internal successors, (93), 88 states have internal predecessors, (93), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2021-08-27 05:25:49,348 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 27 [2021-08-27 05:25:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:49,348 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2021-08-27 05:25:49,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2021-08-27 05:25:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 05:25:49,349 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:49,349 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:49,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 05:25:49,350 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1634399055, now seen corresponding path program 1 times [2021-08-27 05:25:49,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:49,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371951038] [2021-08-27 05:25:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:49,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:49,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:49,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371951038] [2021-08-27 05:25:49,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371951038] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:49,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:49,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:25:49,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909781968] [2021-08-27 05:25:49,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:25:49,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:25:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:25:49,409 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:49,567 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2021-08-27 05:25:49,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:25:49,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-08-27 05:25:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:49,568 INFO L225 Difference]: With dead ends: 94 [2021-08-27 05:25:49,568 INFO L226 Difference]: Without dead ends: 94 [2021-08-27 05:25:49,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53.6ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:25:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-27 05:25:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-08-27 05:25:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 87 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-08-27 05:25:49,571 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 27 [2021-08-27 05:25:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:49,571 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-08-27 05:25:49,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-08-27 05:25:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:25:49,572 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:49,572 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:49,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 05:25:49,572 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr10ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash 873236865, now seen corresponding path program 1 times [2021-08-27 05:25:49,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:49,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375928366] [2021-08-27 05:25:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:49,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:49,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:49,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375928366] [2021-08-27 05:25:49,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375928366] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:49,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:49,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 05:25:49,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123681450] [2021-08-27 05:25:49,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:25:49,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:25:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:25:49,804 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:50,543 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2021-08-27 05:25:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 05:25:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-08-27 05:25:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:50,544 INFO L225 Difference]: With dead ends: 142 [2021-08-27 05:25:50,544 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 05:25:50,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 447.0ms TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2021-08-27 05:25:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 05:25:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 109. [2021-08-27 05:25:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 101 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:25:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2021-08-27 05:25:50,548 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 28 [2021-08-27 05:25:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:50,548 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2021-08-27 05:25:50,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2021-08-27 05:25:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:25:50,548 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:50,549 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:50,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 05:25:50,549 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1313641447, now seen corresponding path program 1 times [2021-08-27 05:25:50,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:50,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850729543] [2021-08-27 05:25:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:50,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:50,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:50,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850729543] [2021-08-27 05:25:50,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850729543] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:25:50,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333794209] [2021-08-27 05:25:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:50,745 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:25:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:25:50,746 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-08-27 05:25:50,747 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-08-27 05:25:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:50,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-27 05:25:50,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:50,999 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 17 treesize of output 13 [2021-08-27 05:25:51,091 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-08-27 05:25:51,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-08-27 05:25:51,167 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:51,168 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 33 treesize of output 24 [2021-08-27 05:25:51,265 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:25:51,265 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 41 treesize of output 21 [2021-08-27 05:25:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:51,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333794209] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:25:51,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:25:51,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 05:25:51,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577263222] [2021-08-27 05:25:51,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:25:51,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:51,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:25:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:25:51,291 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:25:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:51,927 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2021-08-27 05:25:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:25:51,927 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-08-27 05:25:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:51,928 INFO L225 Difference]: With dead ends: 113 [2021-08-27 05:25:51,928 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 05:25:51,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 445.2ms TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2021-08-27 05:25:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 05:25:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2021-08-27 05:25:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 100 states have internal predecessors, (106), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2021-08-27 05:25:51,931 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 29 [2021-08-27 05:25:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:51,931 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2021-08-27 05:25:51,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:25:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2021-08-27 05:25:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:25:51,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:51,932 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:25:51,976 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-08-27 05:25:52,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-27 05:25:52,150 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1313641446, now seen corresponding path program 1 times [2021-08-27 05:25:52,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:52,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687495849] [2021-08-27 05:25:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:52,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:52,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:52,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687495849] [2021-08-27 05:25:52,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687495849] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:25:52,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579293841] [2021-08-27 05:25:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:52,311 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:25:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:25:52,325 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-08-27 05:25:52,359 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-08-27 05:25:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:52,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-27 05:25:52,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:25:52,660 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 22 treesize of output 18 [2021-08-27 05:25:52,666 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-08-27 05:25:52,802 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-08-27 05:25:52,802 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 16 treesize of output 26 [2021-08-27 05:25:52,822 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:25:52,822 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 15 treesize of output 15 [2021-08-27 05:25:52,911 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:52,912 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 55 treesize of output 50 [2021-08-27 05:25:52,922 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:25:52,922 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 51 treesize of output 42 [2021-08-27 05:25:53,047 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:25:53,048 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 66 treesize of output 46 [2021-08-27 05:25:53,052 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:25:53,052 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 40 treesize of output 24 [2021-08-27 05:25:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:53,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579293841] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:25:53,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:25:53,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2021-08-27 05:25:53,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639188150] [2021-08-27 05:25:53,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 05:25:53,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 05:25:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-08-27 05:25:53,086 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 21 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:25:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:54,077 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2021-08-27 05:25:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:25:54,078 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-08-27 05:25:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:54,079 INFO L225 Difference]: With dead ends: 109 [2021-08-27 05:25:54,079 INFO L226 Difference]: Without dead ends: 109 [2021-08-27 05:25:54,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 783.4ms TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 05:25:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-27 05:25:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2021-08-27 05:25:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 99 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-08-27 05:25:54,081 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 29 [2021-08-27 05:25:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:54,081 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-08-27 05:25:54,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:25:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-08-27 05:25:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:25:54,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:54,082 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:54,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 05:25:54,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-27 05:25:54,293 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1300539121, now seen corresponding path program 1 times [2021-08-27 05:25:54,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:54,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476936739] [2021-08-27 05:25:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:54,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:54,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:54,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476936739] [2021-08-27 05:25:54,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476936739] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:54,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:54,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 05:25:54,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241775165] [2021-08-27 05:25:54,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:25:54,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:25:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:25:54,540 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:55,286 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2021-08-27 05:25:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 05:25:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-08-27 05:25:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:55,288 INFO L225 Difference]: With dead ends: 142 [2021-08-27 05:25:55,288 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 05:25:55,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 465.0ms TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2021-08-27 05:25:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 05:25:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2021-08-27 05:25:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.452054794520548) internal successors, (106), 100 states have internal predecessors, (106), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2021-08-27 05:25:55,291 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 29 [2021-08-27 05:25:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:55,291 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2021-08-27 05:25:55,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2021-08-27 05:25:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 05:25:55,291 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:55,291 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:55,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 05:25:55,292 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1662007171, now seen corresponding path program 1 times [2021-08-27 05:25:55,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:55,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960086939] [2021-08-27 05:25:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:55,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:55,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:55,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960086939] [2021-08-27 05:25:55,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960086939] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:55,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:55,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 05:25:55,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637621447] [2021-08-27 05:25:55,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:25:55,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:25:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:25:55,512 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:56,007 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2021-08-27 05:25:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:25:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2021-08-27 05:25:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:56,008 INFO L225 Difference]: With dead ends: 119 [2021-08-27 05:25:56,008 INFO L226 Difference]: Without dead ends: 119 [2021-08-27 05:25:56,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 273.0ms TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-08-27 05:25:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-27 05:25:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-08-27 05:25:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.445945945945946) internal successors, (107), 101 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2021-08-27 05:25:56,011 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 30 [2021-08-27 05:25:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:56,012 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2021-08-27 05:25:56,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2021-08-27 05:25:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 05:25:56,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:56,012 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:56,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 05:25:56,013 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash -17385164, now seen corresponding path program 1 times [2021-08-27 05:25:56,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:56,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488003119] [2021-08-27 05:25:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:56,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:56,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:56,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488003119] [2021-08-27 05:25:56,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488003119] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:56,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:56,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 05:25:56,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966388852] [2021-08-27 05:25:56,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 05:25:56,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:56,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 05:25:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:25:56,119 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:56,380 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-08-27 05:25:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:25:56,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-08-27 05:25:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:56,382 INFO L225 Difference]: With dead ends: 109 [2021-08-27 05:25:56,382 INFO L226 Difference]: Without dead ends: 109 [2021-08-27 05:25:56,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 107.7ms TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:25:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-27 05:25:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2021-08-27 05:25:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 100 states have internal predecessors, (106), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2021-08-27 05:25:56,385 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2021-08-27 05:25:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:56,385 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2021-08-27 05:25:56,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2021-08-27 05:25:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 05:25:56,385 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:56,386 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:56,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 05:25:56,386 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash -17385163, now seen corresponding path program 1 times [2021-08-27 05:25:56,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:56,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537266774] [2021-08-27 05:25:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:56,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:56,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:56,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537266774] [2021-08-27 05:25:56,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537266774] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:56,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:56,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:25:56,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333494652] [2021-08-27 05:25:56,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:25:56,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:25:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:25:56,443 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:56,562 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2021-08-27 05:25:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:25:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-08-27 05:25:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:56,563 INFO L225 Difference]: With dead ends: 101 [2021-08-27 05:25:56,563 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 05:25:56,563 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 41.1ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:25:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 05:25:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 05:25:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2021-08-27 05:25:56,568 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 31 [2021-08-27 05:25:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:56,568 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-08-27 05:25:56,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2021-08-27 05:25:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 05:25:56,569 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:56,569 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:56,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 05:25:56,569 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash -538940057, now seen corresponding path program 1 times [2021-08-27 05:25:56,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:56,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655771039] [2021-08-27 05:25:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:56,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:56,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:56,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655771039] [2021-08-27 05:25:56,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655771039] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:56,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:56,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:25:56,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412251192] [2021-08-27 05:25:56,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:25:56,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:25:56,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:56,667 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:56,838 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-08-27 05:25:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:25:56,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-08-27 05:25:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:56,839 INFO L225 Difference]: With dead ends: 100 [2021-08-27 05:25:56,839 INFO L226 Difference]: Without dead ends: 100 [2021-08-27 05:25:56,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 83.4ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:25:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-27 05:25:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-08-27 05:25:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 92 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2021-08-27 05:25:56,841 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 32 [2021-08-27 05:25:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:56,842 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2021-08-27 05:25:56,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2021-08-27 05:25:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 05:25:56,842 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:56,842 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:56,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 05:25:56,843 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr16ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 472727508, now seen corresponding path program 1 times [2021-08-27 05:25:56,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:56,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280508184] [2021-08-27 05:25:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:56,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:56,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:56,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280508184] [2021-08-27 05:25:56,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280508184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:56,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:56,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:25:56,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218236727] [2021-08-27 05:25:56,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:25:56,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:25:56,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:25:56,929 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:57,148 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2021-08-27 05:25:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:25:57,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-08-27 05:25:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:57,150 INFO L225 Difference]: With dead ends: 99 [2021-08-27 05:25:57,150 INFO L226 Difference]: Without dead ends: 99 [2021-08-27 05:25:57,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 90.2ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:25:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-27 05:25:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-08-27 05:25:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 91 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:25:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2021-08-27 05:25:57,152 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 33 [2021-08-27 05:25:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:57,152 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2021-08-27 05:25:57,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2021-08-27 05:25:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 05:25:57,153 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:57,153 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:57,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 05:25:57,153 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1769650953, now seen corresponding path program 1 times [2021-08-27 05:25:57,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:57,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072911913] [2021-08-27 05:25:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:57,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:57,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:57,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:57,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072911913] [2021-08-27 05:25:57,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072911913] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:57,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:57,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 05:25:57,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150380724] [2021-08-27 05:25:57,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 05:25:57,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 05:25:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:25:57,462 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:57,980 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2021-08-27 05:25:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 05:25:57,981 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2021-08-27 05:25:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:57,982 INFO L225 Difference]: With dead ends: 124 [2021-08-27 05:25:57,982 INFO L226 Difference]: Without dead ends: 124 [2021-08-27 05:25:57,982 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 320.1ms TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-08-27 05:25:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-27 05:25:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2021-08-27 05:25:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 111 states have internal predecessors, (120), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:25:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2021-08-27 05:25:57,986 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 34 [2021-08-27 05:25:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:57,986 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2021-08-27 05:25:57,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:25:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2021-08-27 05:25:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 05:25:57,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:57,987 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:57,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 05:25:57,987 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash -975395209, now seen corresponding path program 1 times [2021-08-27 05:25:57,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:57,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596076346] [2021-08-27 05:25:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:57,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:58,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:58,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596076346] [2021-08-27 05:25:58,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596076346] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:58,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:58,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:25:58,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86870806] [2021-08-27 05:25:58,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:25:58,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:25:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:25:58,084 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:58,313 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2021-08-27 05:25:58,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 05:25:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2021-08-27 05:25:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:58,315 INFO L225 Difference]: With dead ends: 126 [2021-08-27 05:25:58,315 INFO L226 Difference]: Without dead ends: 126 [2021-08-27 05:25:58,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 85.1ms TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:25:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-08-27 05:25:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2021-08-27 05:25:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:25:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2021-08-27 05:25:58,318 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 35 [2021-08-27 05:25:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:58,319 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2021-08-27 05:25:58,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2021-08-27 05:25:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:25:58,319 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:58,320 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:58,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 05:25:58,320 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1581588223, now seen corresponding path program 1 times [2021-08-27 05:25:58,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:58,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979159789] [2021-08-27 05:25:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:58,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:58,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:58,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:58,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:58,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979159789] [2021-08-27 05:25:58,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979159789] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:58,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:58,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 05:25:58,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442142271] [2021-08-27 05:25:58,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:25:58,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:58,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:25:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:25:58,660 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:25:59,281 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2021-08-27 05:25:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 05:25:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2021-08-27 05:25:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:25:59,282 INFO L225 Difference]: With dead ends: 137 [2021-08-27 05:25:59,283 INFO L226 Difference]: Without dead ends: 137 [2021-08-27 05:25:59,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 469.2ms TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2021-08-27 05:25:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-27 05:25:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2021-08-27 05:25:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 119 states have internal predecessors, (129), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:25:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-08-27 05:25:59,286 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 39 [2021-08-27 05:25:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:25:59,286 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-08-27 05:25:59,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:25:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-08-27 05:25:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:25:59,286 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:25:59,287 INFO L512 BasicCegarLoop]: trace histogram [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-08-27 05:25:59,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 05:25:59,287 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr40ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:25:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:25:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1581588867, now seen corresponding path program 1 times [2021-08-27 05:25:59,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:25:59,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319268038] [2021-08-27 05:25:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:25:59,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:25:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:25:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:25:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:25:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:25:59,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:25:59,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319268038] [2021-08-27 05:25:59,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319268038] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:25:59,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:25:59,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 05:25:59,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991887614] [2021-08-27 05:25:59,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:25:59,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:25:59,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:25:59,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:25:59,806 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:26:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:26:00,535 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2021-08-27 05:26:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 05:26:00,536 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2021-08-27 05:26:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:26:00,537 INFO L225 Difference]: With dead ends: 133 [2021-08-27 05:26:00,537 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 05:26:00,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 539.6ms TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2021-08-27 05:26:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 05:26:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2021-08-27 05:26:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 104 states have internal predecessors, (113), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:26:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2021-08-27 05:26:00,539 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 39 [2021-08-27 05:26:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:26:00,539 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2021-08-27 05:26:00,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:26:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2021-08-27 05:26:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 05:26:00,540 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:26:00,540 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:26:00,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 05:26:00,540 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr10ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:26:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:26:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash -425207857, now seen corresponding path program 1 times [2021-08-27 05:26:00,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:26:00,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913939585] [2021-08-27 05:26:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:26:00,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:26:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:26:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:26:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:26:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:26:00,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:26:00,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913939585] [2021-08-27 05:26:00,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913939585] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:26:00,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61600562] [2021-08-27 05:26:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:26:00,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:26:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:26:00,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:26:00,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 05:26:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:00,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 05:26:00,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:26:01,058 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 16 treesize of output 12 [2021-08-27 05:26:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:26:01,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61600562] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:26:01,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:26:01,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2021-08-27 05:26:01,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332701710] [2021-08-27 05:26:01,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:26:01,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:26:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:26:01,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:26:01,207 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:26:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:26:01,803 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2021-08-27 05:26:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:26:01,804 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2021-08-27 05:26:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:26:01,804 INFO L225 Difference]: With dead ends: 89 [2021-08-27 05:26:01,804 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 05:26:01,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 500.9ms TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2021-08-27 05:26:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 05:26:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-08-27 05:26:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.3125) internal successors, (84), 81 states have internal predecessors, (84), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:26:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2021-08-27 05:26:01,819 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 42 [2021-08-27 05:26:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:26:01,819 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2021-08-27 05:26:01,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:26:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2021-08-27 05:26:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 05:26:01,820 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:26:01,820 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:26:01,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 05:26:02,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:26:02,037 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr10ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:26:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:26:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash -44963474, now seen corresponding path program 1 times [2021-08-27 05:26:02,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:26:02,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236670962] [2021-08-27 05:26:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:26:02,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:26:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:26:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:26:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:26:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:26:02,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:26:02,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236670962] [2021-08-27 05:26:02,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236670962] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:26:02,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246050231] [2021-08-27 05:26:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:26:02,693 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:26:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:26:02,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:26:02,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 05:26:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:02,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 78 conjunts are in the unsatisfiable core [2021-08-27 05:26:02,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:26:02,993 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-08-27 05:26:03,170 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 13 treesize of output 9 [2021-08-27 05:26:03,232 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 40 treesize of output 36 [2021-08-27 05:26:03,243 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-08-27 05:26:03,243 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 41 treesize of output 40 [2021-08-27 05:26:03,313 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:26:03,314 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 15 treesize of output 15 [2021-08-27 05:26:03,868 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 110 treesize of output 106 [2021-08-27 05:26:03,993 INFO L354 Elim1Store]: treesize reduction 489, result has 8.9 percent of original size [2021-08-27 05:26:03,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 246 treesize of output 170 [2021-08-27 05:26:03,997 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 120 treesize of output 104 [2021-08-27 05:26:04,009 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-08-27 05:26:04,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 110 [2021-08-27 05:26:04,015 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-08-27 05:26:04,015 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 6 case distinctions, treesize of input 101 treesize of output 77 [2021-08-27 05:26:04,265 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 79 treesize of output 55 [2021-08-27 05:26:04,355 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-08-27 05:26:04,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 36 [2021-08-27 05:26:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:26:04,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246050231] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:26:04,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:26:04,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2021-08-27 05:26:04,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729899742] [2021-08-27 05:26:04,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-27 05:26:04,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:26:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-27 05:26:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2021-08-27 05:26:04,361 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 38 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:26:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:26:06,405 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2021-08-27 05:26:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-27 05:26:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2021-08-27 05:26:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:26:06,407 INFO L225 Difference]: With dead ends: 149 [2021-08-27 05:26:06,407 INFO L226 Difference]: Without dead ends: 149 [2021-08-27 05:26:06,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2134.7ms TimeCoverageRelationStatistics Valid=450, Invalid=4380, Unknown=0, NotChecked=0, Total=4830 [2021-08-27 05:26:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-27 05:26:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 88. [2021-08-27 05:26:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.296875) internal successors, (83), 80 states have internal predecessors, (83), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:26:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2021-08-27 05:26:06,410 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 45 [2021-08-27 05:26:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:26:06,410 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2021-08-27 05:26:06,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:26:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2021-08-27 05:26:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 05:26:06,410 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:26:06,410 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:26:06,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 05:26:06,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-27 05:26:06,620 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr11ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:26:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:26:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1393867612, now seen corresponding path program 1 times [2021-08-27 05:26:06,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:26:06,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969658082] [2021-08-27 05:26:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:26:06,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:26:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:26:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:26:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:26:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:26:07,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:26:07,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969658082] [2021-08-27 05:26:07,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969658082] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:26:07,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657256154] [2021-08-27 05:26:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:26:07,493 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:26:07,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:26:07,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:26:07,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 05:26:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:26:07,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 70 conjunts are in the unsatisfiable core [2021-08-27 05:26:07,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:26:07,988 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 17 treesize of output 13 [2021-08-27 05:26:08,068 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:26:08,068 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 27 treesize of output 34 [2021-08-27 05:26:08,082 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-08-27 05:26:08,263 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 05:26:08,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2021-08-27 05:26:08,268 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:26:08,269 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 24 treesize of output 20 [2021-08-27 05:26:08,271 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 11 treesize of output 7 [2021-08-27 05:26:14,661 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-08-27 05:26:14,810 INFO L354 Elim1Store]: treesize reduction 227, result has 11.0 percent of original size [2021-08-27 05:26:14,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 109 [2021-08-27 05:26:14,815 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 163 treesize of output 147 [2021-08-27 05:26:14,824 INFO L354 Elim1Store]: treesize reduction 33, result has 32.7 percent of original size [2021-08-27 05:26:14,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 75 [2021-08-27 05:26:15,066 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 90 treesize of output 82 [2021-08-27 05:26:15,150 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-08-27 05:26:15,150 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 30 [2021-08-27 05:26:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:26:15,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657256154] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:26:15,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:26:15,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2021-08-27 05:26:15,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885783399] [2021-08-27 05:26:15,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-27 05:26:15,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:26:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-27 05:26:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1380, Unknown=9, NotChecked=0, Total=1482 [2021-08-27 05:26:15,166 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 39 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:27:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:27:15,545 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2021-08-27 05:27:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 05:27:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 46 [2021-08-27 05:27:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:27:15,547 INFO L225 Difference]: With dead ends: 114 [2021-08-27 05:27:15,547 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 05:27:15,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 34713.1ms TimeCoverageRelationStatistics Valid=364, Invalid=3771, Unknown=25, NotChecked=0, Total=4160 [2021-08-27 05:27:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 05:27:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2021-08-27 05:27:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.28125) internal successors, (82), 79 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:27:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2021-08-27 05:27:15,549 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 46 [2021-08-27 05:27:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:27:15,549 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2021-08-27 05:27:15,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:27:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2021-08-27 05:27:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 05:27:15,550 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:27:15,550 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:27:15,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 05:27:15,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-08-27 05:27:15,761 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr12ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:27:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:27:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash -260222928, now seen corresponding path program 1 times [2021-08-27 05:27:15,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:27:15,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233609207] [2021-08-27 05:27:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:27:15,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:27:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:27:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:27:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:27:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:27:16,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:27:16,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233609207] [2021-08-27 05:27:16,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233609207] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:27:16,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531150941] [2021-08-27 05:27:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:27:16,594 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:27:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:27:16,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:27:16,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 05:27:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:17,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 80 conjunts are in the unsatisfiable core [2021-08-27 05:27:17,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:27:17,023 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-08-27 05:27:17,167 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-08-27 05:27:17,217 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 19 treesize of output 15 [2021-08-27 05:27:17,309 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:27:17,310 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 31 treesize of output 38 [2021-08-27 05:27:17,326 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-08-27 05:27:17,401 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:27:17,401 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 15 treesize of output 15 [2021-08-27 05:27:18,142 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-08-27 05:27:18,348 INFO L354 Elim1Store]: treesize reduction 429, result has 10.1 percent of original size [2021-08-27 05:27:18,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 210 treesize of output 152 [2021-08-27 05:27:18,356 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 251 treesize of output 227 [2021-08-27 05:27:18,361 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-08-27 05:27:18,362 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 76 [2021-08-27 05:27:18,401 INFO L354 Elim1Store]: treesize reduction 210, result has 25.5 percent of original size [2021-08-27 05:27:18,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 90 treesize of output 128 [2021-08-27 05:27:18,790 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 137 treesize of output 129 [2021-08-27 05:27:18,905 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-08-27 05:27:18,906 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 49 [2021-08-27 05:27:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:27:19,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531150941] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:27:19,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:27:19,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2021-08-27 05:27:19,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699011479] [2021-08-27 05:27:19,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-08-27 05:27:19,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:27:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-08-27 05:27:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1649, Unknown=0, NotChecked=0, Total=1806 [2021-08-27 05:27:19,169 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 43 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:27:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:27:38,807 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2021-08-27 05:27:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 05:27:38,807 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 47 [2021-08-27 05:27:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:27:38,808 INFO L225 Difference]: With dead ends: 87 [2021-08-27 05:27:38,808 INFO L226 Difference]: Without dead ends: 87 [2021-08-27 05:27:38,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 3811.7ms TimeCoverageRelationStatistics Valid=306, Invalid=3000, Unknown=0, NotChecked=0, Total=3306 [2021-08-27 05:27:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-08-27 05:27:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2021-08-27 05:27:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.265625) internal successors, (81), 78 states have internal predecessors, (81), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:27:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2021-08-27 05:27:38,810 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 47 [2021-08-27 05:27:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:27:38,811 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-08-27 05:27:38,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:27:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2021-08-27 05:27:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 05:27:38,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:27:38,811 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:27:38,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 05:27:39,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:27:39,021 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:27:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:27:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash -735988426, now seen corresponding path program 1 times [2021-08-27 05:27:39,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:27:39,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744440847] [2021-08-27 05:27:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:27:39,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:27:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:27:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:27:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:27:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:27:39,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:27:39,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744440847] [2021-08-27 05:27:39,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744440847] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:27:39,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299378195] [2021-08-27 05:27:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:27:39,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:27:39,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:27:39,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:27:39,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 05:27:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:27:40,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 85 conjunts are in the unsatisfiable core [2021-08-27 05:27:40,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:27:40,463 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-08-27 05:27:40,622 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-08-27 05:27:40,679 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 19 treesize of output 15 [2021-08-27 05:27:40,774 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:27:40,775 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 31 treesize of output 38 [2021-08-27 05:27:40,792 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-08-27 05:27:40,886 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:27:40,887 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 15 treesize of output 15 [2021-08-27 05:28:07,942 INFO L354 Elim1Store]: treesize reduction 439, result has 8.0 percent of original size [2021-08-27 05:28:07,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 204 treesize of output 136 [2021-08-27 05:28:07,948 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 225 treesize of output 209 [2021-08-27 05:28:07,952 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-08-27 05:28:07,953 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 6 case distinctions, treesize of input 152 treesize of output 120 [2021-08-27 05:28:07,968 INFO L354 Elim1Store]: treesize reduction 84, result has 30.6 percent of original size [2021-08-27 05:28:07,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 84 [2021-08-27 05:28:08,491 INFO L354 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2021-08-27 05:28:08,491 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 30 treesize of output 54 [2021-08-27 05:28:08,600 INFO L354 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2021-08-27 05:28:08,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 76 [2021-08-27 05:28:08,604 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 64 treesize of output 52 [2021-08-27 05:28:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:28:08,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299378195] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:28:08,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:28:08,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2021-08-27 05:28:08,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150958290] [2021-08-27 05:28:08,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-08-27 05:28:08,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:28:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-08-27 05:28:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1996, Unknown=13, NotChecked=0, Total=2162 [2021-08-27 05:28:08,857 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 47 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:29:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:29:34,020 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2021-08-27 05:29:34,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-27 05:29:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 51 [2021-08-27 05:29:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:29:34,022 INFO L225 Difference]: With dead ends: 142 [2021-08-27 05:29:34,022 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 05:29:34,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 65532.3ms TimeCoverageRelationStatistics Valid=403, Invalid=4680, Unknown=29, NotChecked=0, Total=5112 [2021-08-27 05:29:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 05:29:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 103. [2021-08-27 05:29:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.225) internal successors, (98), 94 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:29:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2021-08-27 05:29:34,025 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 51 [2021-08-27 05:29:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:29:34,026 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2021-08-27 05:29:34,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:29:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2021-08-27 05:29:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 05:29:34,026 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:29:34,026 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:29:34,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 05:29:34,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:29:34,237 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:29:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:29:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1340804630, now seen corresponding path program 1 times [2021-08-27 05:29:34,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:29:34,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757286823] [2021-08-27 05:29:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:29:34,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:29:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:34,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:29:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:34,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:29:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:34,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:29:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:29:34,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:29:34,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757286823] [2021-08-27 05:29:34,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757286823] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:29:34,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358567145] [2021-08-27 05:29:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:29:34,357 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:29:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:29:34,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:29:34,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 05:29:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:34,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-27 05:29:34,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:29:35,167 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 17 treesize of output 13 [2021-08-27 05:29:35,182 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:29:35,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-08-27 05:29:35,269 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 16 treesize of output 8 [2021-08-27 05:29:35,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-08-27 05:29:35,330 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:29:35,330 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 16 treesize of output 18 [2021-08-27 05:29:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:29:35,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358567145] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:29:35,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:29:35,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2021-08-27 05:29:35,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319744610] [2021-08-27 05:29:35,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:29:35,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:29:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:29:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:29:35,355 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 16 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:29:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:29:35,669 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2021-08-27 05:29:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 05:29:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 52 [2021-08-27 05:29:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:29:35,670 INFO L225 Difference]: With dead ends: 128 [2021-08-27 05:29:35,670 INFO L226 Difference]: Without dead ends: 128 [2021-08-27 05:29:35,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 234.8ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-08-27 05:29:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-27 05:29:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2021-08-27 05:29:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2125) internal successors, (97), 93 states have internal predecessors, (97), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:29:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2021-08-27 05:29:35,672 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 52 [2021-08-27 05:29:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:29:35,672 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2021-08-27 05:29:35,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:29:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2021-08-27 05:29:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 05:29:35,672 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:29:35,672 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:29:35,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 05:29:35,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-08-27 05:29:35,881 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:29:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:29:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash -685098252, now seen corresponding path program 1 times [2021-08-27 05:29:35,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:29:35,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568311750] [2021-08-27 05:29:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:29:35,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:29:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:36,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:29:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:36,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:29:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:36,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:29:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:29:37,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:29:37,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568311750] [2021-08-27 05:29:37,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568311750] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:29:37,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480193230] [2021-08-27 05:29:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:29:37,169 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:29:37,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:29:37,170 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:29:37,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 05:29:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:37,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 99 conjunts are in the unsatisfiable core [2021-08-27 05:29:37,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:29:37,857 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-08-27 05:29:38,112 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 22 treesize of output 18 [2021-08-27 05:29:38,213 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-08-27 05:29:38,241 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:29:38,241 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 34 treesize of output 41 [2021-08-27 05:29:38,388 INFO L354 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2021-08-27 05:29:38,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2021-08-27 05:29:45,363 INFO L354 Elim1Store]: treesize reduction 439, result has 8.0 percent of original size [2021-08-27 05:29:45,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 228 treesize of output 144 [2021-08-27 05:29:45,368 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 265 treesize of output 249 [2021-08-27 05:29:45,373 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-08-27 05:29:45,373 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 70 [2021-08-27 05:29:45,383 INFO L354 Elim1Store]: treesize reduction 33, result has 32.7 percent of original size [2021-08-27 05:29:45,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 106 [2021-08-27 05:29:46,116 INFO L354 Elim1Store]: treesize reduction 41, result has 48.8 percent of original size [2021-08-27 05:29:46,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 62 [2021-08-27 05:29:46,233 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 81 treesize of output 65 [2021-08-27 05:29:46,516 INFO L354 Elim1Store]: treesize reduction 71, result has 15.5 percent of original size [2021-08-27 05:29:46,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2021-08-27 05:29:46,629 INFO L354 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2021-08-27 05:29:46,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 102 treesize of output 65 [2021-08-27 05:29:46,799 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-08-27 05:29:46,799 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 6 case distinctions, treesize of input 77 treesize of output 40 [2021-08-27 05:29:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:29:46,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480193230] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:29:46,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:29:46,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2021-08-27 05:29:46,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80151443] [2021-08-27 05:29:46,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-08-27 05:29:46,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:29:46,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-08-27 05:29:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3106, Unknown=3, NotChecked=0, Total=3306 [2021-08-27 05:29:46,871 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 58 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 54 states have internal predecessors, (96), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:29:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:29:54,304 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2021-08-27 05:29:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-27 05:29:54,304 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 54 states have internal predecessors, (96), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2021-08-27 05:29:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:29:54,305 INFO L225 Difference]: With dead ends: 139 [2021-08-27 05:29:54,305 INFO L226 Difference]: Without dead ends: 139 [2021-08-27 05:29:54,307 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 14218.6ms TimeCoverageRelationStatistics Valid=574, Invalid=8165, Unknown=3, NotChecked=0, Total=8742 [2021-08-27 05:29:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-27 05:29:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 107. [2021-08-27 05:29:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.223529411764706) internal successors, (104), 98 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:29:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-08-27 05:29:54,309 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 56 [2021-08-27 05:29:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:29:54,309 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-08-27 05:29:54,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 54 states have internal predecessors, (96), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:29:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-08-27 05:29:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 05:29:54,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:29:54,309 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:29:54,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 05:29:54,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:29:54,517 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:29:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:29:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash -685098251, now seen corresponding path program 1 times [2021-08-27 05:29:54,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:29:54,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044494939] [2021-08-27 05:29:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:29:54,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:29:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:29:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:29:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:29:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:29:55,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:29:55,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044494939] [2021-08-27 05:29:55,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044494939] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:29:55,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873667465] [2021-08-27 05:29:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:29:55,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:29:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:29:55,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:29:55,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 05:29:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:29:56,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 76 conjunts are in the unsatisfiable core [2021-08-27 05:29:56,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:29:56,199 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-08-27 05:29:56,431 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-08-27 05:29:56,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:29:56,712 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 29 treesize of output 28 [2021-08-27 05:29:58,099 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:29:58,099 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 73 treesize of output 80 [2021-08-27 05:29:58,982 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 05:29:58,983 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 1 case distinctions, treesize of input 95 treesize of output 59 [2021-08-27 05:29:59,029 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:29:59,029 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 15 treesize of output 15 [2021-08-27 05:29:59,681 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 05:29:59,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 77 [2021-08-27 05:29:59,700 INFO L354 Elim1Store]: treesize reduction 72, result has 13.3 percent of original size [2021-08-27 05:29:59,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 53 [2021-08-27 05:29:59,820 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:29:59,820 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 63 treesize of output 47 [2021-08-27 05:29:59,824 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:29:59,824 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 41 treesize of output 21 [2021-08-27 05:29:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:29:59,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873667465] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:29:59,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:29:59,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2021-08-27 05:29:59,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449262185] [2021-08-27 05:29:59,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-27 05:29:59,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:29:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-27 05:29:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1210, Unknown=1, NotChecked=0, Total=1332 [2021-08-27 05:29:59,842 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 37 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 34 states have internal predecessors, (87), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:30:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:30:08,801 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2021-08-27 05:30:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:30:08,818 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 34 states have internal predecessors, (87), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 56 [2021-08-27 05:30:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:30:08,819 INFO L225 Difference]: With dead ends: 139 [2021-08-27 05:30:08,819 INFO L226 Difference]: Without dead ends: 139 [2021-08-27 05:30:08,820 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 9776.5ms TimeCoverageRelationStatistics Valid=343, Invalid=3194, Unknown=3, NotChecked=0, Total=3540 [2021-08-27 05:30:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-27 05:30:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2021-08-27 05:30:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 102 states have internal predecessors, (109), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:30:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2021-08-27 05:30:08,822 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 56 [2021-08-27 05:30:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:30:08,822 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2021-08-27 05:30:08,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 34 states have internal predecessors, (87), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:30:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2021-08-27 05:30:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 05:30:08,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:30:08,823 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:30:08,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 05:30:09,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-08-27 05:30:09,033 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr40ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:30:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:30:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -685098896, now seen corresponding path program 1 times [2021-08-27 05:30:09,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:30:09,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506002018] [2021-08-27 05:30:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:30:09,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:30:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:30:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:30:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:30:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:30:09,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:30:09,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506002018] [2021-08-27 05:30:09,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506002018] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:30:09,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266917372] [2021-08-27 05:30:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:30:09,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:30:09,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:30:09,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:30:09,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 05:30:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:10,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 58 conjunts are in the unsatisfiable core [2021-08-27 05:30:10,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:30:10,506 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 16 treesize of output 12 [2021-08-27 05:30:20,134 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 05:30:20,135 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 1 case distinctions, treesize of input 60 treesize of output 36 [2021-08-27 05:30:20,141 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:30:20,141 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 27 [2021-08-27 05:30:20,432 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 23 treesize of output 15 [2021-08-27 05:30:20,597 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:30:20,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 26 [2021-08-27 05:30:20,656 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:30:20,656 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 31 treesize of output 15 [2021-08-27 05:30:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:30:20,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266917372] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:30:20,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:30:20,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2021-08-27 05:30:20,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430357621] [2021-08-27 05:30:20,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-27 05:30:20,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:30:20,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-27 05:30:20,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1074, Unknown=7, NotChecked=0, Total=1190 [2021-08-27 05:30:20,665 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 35 states, 34 states have (on average 2.5) internal successors, (85), 32 states have internal predecessors, (85), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:30:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:30:43,619 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2021-08-27 05:30:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 05:30:43,620 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 32 states have internal predecessors, (85), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 56 [2021-08-27 05:30:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:30:43,621 INFO L225 Difference]: With dead ends: 135 [2021-08-27 05:30:43,621 INFO L226 Difference]: Without dead ends: 135 [2021-08-27 05:30:43,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 19005.4ms TimeCoverageRelationStatistics Valid=322, Invalid=2855, Unknown=15, NotChecked=0, Total=3192 [2021-08-27 05:30:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-27 05:30:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2021-08-27 05:30:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.202247191011236) internal successors, (107), 102 states have internal predecessors, (107), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:30:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2021-08-27 05:30:43,624 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 56 [2021-08-27 05:30:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:30:43,624 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2021-08-27 05:30:43,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 32 states have internal predecessors, (85), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:30:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2021-08-27 05:30:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:30:43,624 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:30:43,624 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:30:43,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-27 05:30:43,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-08-27 05:30:43,833 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr35ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:30:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:30:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1896261991, now seen corresponding path program 1 times [2021-08-27 05:30:43,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:30:43,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653835656] [2021-08-27 05:30:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:30:43,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:30:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:30:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:30:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:30:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:30:44,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:30:44,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653835656] [2021-08-27 05:30:44,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653835656] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:30:44,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507912215] [2021-08-27 05:30:44,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:30:44,412 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:30:44,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:30:44,414 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:30:44,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 05:30:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:30:45,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 59 conjunts are in the unsatisfiable core [2021-08-27 05:30:45,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:30:45,501 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-08-27 05:30:48,529 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 58 treesize of output 54 [2021-08-27 05:30:49,706 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 05:30:49,706 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 1 case distinctions, treesize of input 65 treesize of output 33 [2021-08-27 05:30:49,723 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:30:49,723 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 15 treesize of output 15 [2021-08-27 05:30:49,820 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 27 treesize of output 15 [2021-08-27 05:30:50,223 INFO L354 Elim1Store]: treesize reduction 72, result has 13.3 percent of original size [2021-08-27 05:30:50,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 31 [2021-08-27 05:30:50,367 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:30:50,368 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 30 treesize of output 14 [2021-08-27 05:30:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:30:50,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507912215] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:30:50,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:30:50,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 35 [2021-08-27 05:30:50,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728561762] [2021-08-27 05:30:50,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-27 05:30:50,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:30:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-27 05:30:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1128, Unknown=3, NotChecked=0, Total=1260 [2021-08-27 05:30:50,373 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 36 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 33 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:31:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:31:08,438 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2021-08-27 05:31:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:31:08,439 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 33 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 60 [2021-08-27 05:31:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:31:08,456 INFO L225 Difference]: With dead ends: 134 [2021-08-27 05:31:08,456 INFO L226 Difference]: Without dead ends: 134 [2021-08-27 05:31:08,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 14014.9ms TimeCoverageRelationStatistics Valid=367, Invalid=3046, Unknown=9, NotChecked=0, Total=3422 [2021-08-27 05:31:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-27 05:31:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2021-08-27 05:31:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 112 states have internal predecessors, (124), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:31:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2021-08-27 05:31:08,461 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 60 [2021-08-27 05:31:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:31:08,462 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2021-08-27 05:31:08,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 33 states have internal predecessors, (95), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:31:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2021-08-27 05:31:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:31:08,462 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:31:08,463 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:31:08,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-08-27 05:31:08,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-08-27 05:31:08,682 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:31:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:31:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1896248059, now seen corresponding path program 1 times [2021-08-27 05:31:08,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:31:08,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046475807] [2021-08-27 05:31:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:31:08,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:31:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:08,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:31:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:31:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:09,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:31:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:31:09,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:31:09,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046475807] [2021-08-27 05:31:09,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046475807] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:31:09,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210344873] [2021-08-27 05:31:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:31:09,765 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:31:09,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:31:09,766 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:31:09,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 05:31:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:10,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 65 conjunts are in the unsatisfiable core [2021-08-27 05:31:10,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:31:10,988 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-08-27 05:31:10,997 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-08-27 05:31:11,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:31:11,211 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 42 treesize of output 41 [2021-08-27 05:31:11,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:31:11,216 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 29 treesize of output 28 [2021-08-27 05:31:11,271 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:31:11,272 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 43 treesize of output 50 [2021-08-27 05:31:11,290 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-08-27 05:31:11,290 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 59 treesize of output 70 [2021-08-27 05:31:11,439 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:31:11,439 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 15 treesize of output 15 [2021-08-27 05:31:12,033 INFO L354 Elim1Store]: treesize reduction 108, result has 12.2 percent of original size [2021-08-27 05:31:12,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 73 [2021-08-27 05:31:12,049 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:31:12,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 44 [2021-08-27 05:31:12,387 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:31:12,387 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 63 treesize of output 47 [2021-08-27 05:31:12,391 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:31:12,392 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 41 treesize of output 21 [2021-08-27 05:31:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:31:12,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210344873] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:31:12,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:31:12,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2021-08-27 05:31:12,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678266299] [2021-08-27 05:31:12,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-08-27 05:31:12,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:31:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-08-27 05:31:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1443, Unknown=0, NotChecked=0, Total=1560 [2021-08-27 05:31:12,402 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 40 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 states have internal predecessors, (104), 4 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:31:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:31:14,798 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-08-27 05:31:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-27 05:31:14,798 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 states have internal predecessors, (104), 4 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 60 [2021-08-27 05:31:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:31:14,799 INFO L225 Difference]: With dead ends: 136 [2021-08-27 05:31:14,799 INFO L226 Difference]: Without dead ends: 136 [2021-08-27 05:31:14,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 2823.9ms TimeCoverageRelationStatistics Valid=434, Invalid=4122, Unknown=0, NotChecked=0, Total=4556 [2021-08-27 05:31:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-27 05:31:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2021-08-27 05:31:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 112 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:31:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-08-27 05:31:14,801 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 60 [2021-08-27 05:31:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:31:14,801 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-08-27 05:31:14,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 2.736842105263158) internal successors, (104), 37 states have internal predecessors, (104), 4 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:31:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-08-27 05:31:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:31:14,802 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:31:14,802 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:31:14,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 05:31:15,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-08-27 05:31:15,003 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:31:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:31:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1896248058, now seen corresponding path program 1 times [2021-08-27 05:31:15,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:31:15,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379688386] [2021-08-27 05:31:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:31:15,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:31:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:31:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:31:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:31:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-27 05:31:15,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:31:15,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379688386] [2021-08-27 05:31:15,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379688386] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:31:15,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:31:15,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:31:15,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618005282] [2021-08-27 05:31:15,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:31:15,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:31:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:31:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:31:15,074 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:31:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:31:15,258 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2021-08-27 05:31:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:31:15,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2021-08-27 05:31:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:31:15,259 INFO L225 Difference]: With dead ends: 127 [2021-08-27 05:31:15,259 INFO L226 Difference]: Without dead ends: 127 [2021-08-27 05:31:15,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.3ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:31:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-27 05:31:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2021-08-27 05:31:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 111 states have internal predecessors, (121), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:31:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-08-27 05:31:15,261 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 60 [2021-08-27 05:31:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:31:15,261 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-08-27 05:31:15,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:31:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-08-27 05:31:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 05:31:15,262 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:31:15,262 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:31:15,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-27 05:31:15,262 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:31:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:31:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1345420281, now seen corresponding path program 1 times [2021-08-27 05:31:15,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:31:15,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033691773] [2021-08-27 05:31:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:31:15,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:31:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:31:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:31:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:31:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:31:15,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:31:15,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033691773] [2021-08-27 05:31:15,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033691773] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:31:15,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197146426] [2021-08-27 05:31:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:31:15,768 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:31:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:31:15,769 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:31:15,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-27 05:31:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:31:16,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-27 05:31:16,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:31:17,030 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 17 treesize of output 13 [2021-08-27 05:31:17,109 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 15 treesize of output 11 [2021-08-27 05:31:30,153 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 05:31:30,154 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 1 case distinctions, treesize of input 60 treesize of output 40 [2021-08-27 05:31:30,160 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:31:30,160 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 28 treesize of output 28 [2021-08-27 05:31:30,486 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 23 treesize of output 15 [2021-08-27 05:31:30,637 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:31:30,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 30 [2021-08-27 05:31:30,849 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:31:30,849 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 32 treesize of output 16 [2021-08-27 05:31:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:31:30,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197146426] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:31:30,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:31:30,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2021-08-27 05:31:30,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562747178] [2021-08-27 05:31:30,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-27 05:31:30,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:31:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-27 05:31:30,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1076, Unknown=9, NotChecked=0, Total=1190 [2021-08-27 05:31:30,859 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 35 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:33:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:33:02,920 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-08-27 05:33:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 05:33:02,920 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 61 [2021-08-27 05:33:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:33:02,921 INFO L225 Difference]: With dead ends: 130 [2021-08-27 05:33:02,921 INFO L226 Difference]: Without dead ends: 130 [2021-08-27 05:33:02,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 44662.9ms TimeCoverageRelationStatistics Valid=327, Invalid=2949, Unknown=30, NotChecked=0, Total=3306 [2021-08-27 05:33:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-08-27 05:33:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2021-08-27 05:33:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.22) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:33:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2021-08-27 05:33:02,923 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 61 [2021-08-27 05:33:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:33:02,923 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2021-08-27 05:33:02,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:33:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2021-08-27 05:33:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 05:33:02,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:33:02,924 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:33:02,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-27 05:33:03,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:33:03,124 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr30ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:33:03,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:33:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1345852280, now seen corresponding path program 1 times [2021-08-27 05:33:03,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:33:03,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337653444] [2021-08-27 05:33:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:33:03,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:33:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:33:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:33:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:33:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:33:04,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:33:04,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337653444] [2021-08-27 05:33:04,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337653444] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:33:04,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120026683] [2021-08-27 05:33:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:33:04,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:33:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:33:04,550 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:33:04,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 05:33:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:05,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 102 conjunts are in the unsatisfiable core [2021-08-27 05:33:05,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:33:05,794 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-08-27 05:33:06,042 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 22 treesize of output 18 [2021-08-27 05:33:06,051 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-08-27 05:33:06,139 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:33:06,139 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 15 treesize of output 15 [2021-08-27 05:33:26,397 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 05:33:26,398 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 1 case distinctions, treesize of input 169 treesize of output 133 [2021-08-27 05:33:26,446 INFO L354 Elim1Store]: treesize reduction 490, result has 9.8 percent of original size [2021-08-27 05:33:26,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 259 treesize of output 188 [2021-08-27 05:33:26,451 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-08-27 05:33:26,451 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 6 case distinctions, treesize of input 137 treesize of output 93 [2021-08-27 05:33:26,459 INFO L354 Elim1Store]: treesize reduction 33, result has 32.7 percent of original size [2021-08-27 05:33:26,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2021-08-27 05:33:27,436 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-08-27 05:33:27,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 90 [2021-08-27 05:33:27,489 INFO L354 Elim1Store]: treesize reduction 184, result has 8.9 percent of original size [2021-08-27 05:33:27,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 93 treesize of output 94 [2021-08-27 05:33:27,816 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:33:27,817 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 86 treesize of output 62 [2021-08-27 05:33:27,954 INFO L354 Elim1Store]: treesize reduction 58, result has 4.9 percent of original size [2021-08-27 05:33:27,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 36 [2021-08-27 05:33:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:33:27,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120026683] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:33:27,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:33:27,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 54 [2021-08-27 05:33:27,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561123755] [2021-08-27 05:33:27,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-08-27 05:33:27,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:33:27,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-08-27 05:33:27,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2772, Unknown=9, NotChecked=0, Total=2970 [2021-08-27 05:33:27,959 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 55 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:34:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:05,898 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2021-08-27 05:34:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-27 05:34:05,898 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 61 [2021-08-27 05:34:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:05,899 INFO L225 Difference]: With dead ends: 160 [2021-08-27 05:34:05,899 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 05:34:05,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 31911.1ms TimeCoverageRelationStatistics Valid=634, Invalid=7013, Unknown=9, NotChecked=0, Total=7656 [2021-08-27 05:34:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 05:34:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2021-08-27 05:34:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.21) internal successors, (121), 112 states have internal predecessors, (121), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:34:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2021-08-27 05:34:05,902 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 61 [2021-08-27 05:34:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:05,903 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2021-08-27 05:34:05,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:34:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2021-08-27 05:34:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 05:34:05,903 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:05,903 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:34:05,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-27 05:34:06,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-08-27 05:34:06,124 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr37ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:34:06,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1241644393, now seen corresponding path program 1 times [2021-08-27 05:34:06,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:06,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550453740] [2021-08-27 05:34:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:06,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:06,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:34:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:34:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-27 05:34:06,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:06,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550453740] [2021-08-27 05:34:06,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550453740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:06,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:06,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:34:06,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571320862] [2021-08-27 05:34:06,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:34:06,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:06,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:34:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:34:06,218 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:34:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:06,374 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2021-08-27 05:34:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:34:06,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2021-08-27 05:34:06,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:06,375 INFO L225 Difference]: With dead ends: 128 [2021-08-27 05:34:06,375 INFO L226 Difference]: Without dead ends: 128 [2021-08-27 05:34:06,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:34:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-27 05:34:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2021-08-27 05:34:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 117 states have internal predecessors, (128), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:34:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2021-08-27 05:34:06,378 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 62 [2021-08-27 05:34:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:06,378 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2021-08-27 05:34:06,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 05:34:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2021-08-27 05:34:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 05:34:06,379 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:06,379 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:34:06,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-27 05:34:06,379 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr31ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:34:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1228252410, now seen corresponding path program 1 times [2021-08-27 05:34:06,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:06,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914862808] [2021-08-27 05:34:06,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:06,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:06,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:34:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:07,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:34:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:34:07,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:07,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914862808] [2021-08-27 05:34:07,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914862808] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:07,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234981355] [2021-08-27 05:34:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:07,907 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:34:07,908 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:34:07,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 05:34:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:09,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 94 conjunts are in the unsatisfiable core [2021-08-27 05:34:09,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:34:09,304 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-08-27 05:34:09,467 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 17 treesize of output 13 [2021-08-27 05:34:09,582 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:34:09,583 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 29 treesize of output 36 [2021-08-27 05:34:09,599 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-08-27 05:34:09,742 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 05:34:09,742 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 15 treesize of output 15 [2021-08-27 05:34:09,875 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 05:34:09,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2021-08-27 05:34:33,504 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-27 05:34:33,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 102 [2021-08-27 05:34:33,515 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 05:34:33,515 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 1 case distinctions, treesize of input 119 treesize of output 87 [2021-08-27 05:34:33,524 INFO L354 Elim1Store]: treesize reduction 33, result has 32.7 percent of original size [2021-08-27 05:34:33,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 71 [2021-08-27 05:34:34,401 INFO L354 Elim1Store]: treesize reduction 108, result has 12.2 percent of original size [2021-08-27 05:34:34,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 108 treesize of output 79 [2021-08-27 05:34:34,423 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-08-27 05:34:34,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 73 [2021-08-27 05:34:34,878 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:34:34,879 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 75 treesize of output 59 [2021-08-27 05:34:35,003 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-08-27 05:34:35,003 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 31 [2021-08-27 05:34:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:34:35,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234981355] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:35,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:34:35,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 51 [2021-08-27 05:34:35,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481175354] [2021-08-27 05:34:35,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-08-27 05:34:35,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-08-27 05:34:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2489, Unknown=14, NotChecked=0, Total=2652 [2021-08-27 05:34:35,031 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 52 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:35:44,917 WARN L207 SmtUtils]: Spent 5.41 s on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2021-08-27 05:36:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:36:02,394 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2021-08-27 05:36:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-08-27 05:36:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 62 [2021-08-27 05:36:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:36:02,395 INFO L225 Difference]: With dead ends: 179 [2021-08-27 05:36:02,395 INFO L226 Difference]: Without dead ends: 179 [2021-08-27 05:36:02,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2498 ImplicationChecksByTransitivity, 70883.8ms TimeCoverageRelationStatistics Valid=862, Invalid=9414, Unknown=26, NotChecked=0, Total=10302 [2021-08-27 05:36:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-27 05:36:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 126. [2021-08-27 05:36:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:36:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2021-08-27 05:36:02,398 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 62 [2021-08-27 05:36:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:36:02,398 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2021-08-27 05:36:02,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 05:36:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2021-08-27 05:36:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 05:36:02,399 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:36:02,399 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:36:02,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 05:36:02,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:36:02,609 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:36:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:36:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash -163729334, now seen corresponding path program 1 times [2021-08-27 05:36:02,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:36:02,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493280208] [2021-08-27 05:36:02,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:36:02,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:36:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:36:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:36:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:36:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 05:36:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:36:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:36:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:36:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-27 05:36:02,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:36:02,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493280208] [2021-08-27 05:36:02,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493280208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:36:02,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:36:02,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:36:02,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229580555] [2021-08-27 05:36:02,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:36:02,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:36:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:36:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:36:02,720 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:36:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:36:02,933 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2021-08-27 05:36:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:36:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2021-08-27 05:36:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:36:02,934 INFO L225 Difference]: With dead ends: 125 [2021-08-27 05:36:02,934 INFO L226 Difference]: Without dead ends: 125 [2021-08-27 05:36:02,935 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 83.8ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:36:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-27 05:36:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-08-27 05:36:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.2) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:36:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2021-08-27 05:36:02,937 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 63 [2021-08-27 05:36:02,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:36:02,937 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2021-08-27 05:36:02,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:36:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2021-08-27 05:36:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 05:36:02,937 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:36:02,938 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:36:02,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-27 05:36:02,938 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr32ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 50 more)] === [2021-08-27 05:36:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:36:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash -578880822, now seen corresponding path program 1 times [2021-08-27 05:36:02,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:36:02,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36372369] [2021-08-27 05:36:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:36:02,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:36:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:36:02,963 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 05:36:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:36:02,993 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 05:36:02,993 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 05:36:02,994 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr32ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:36:02,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:36:02,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 05:36:02,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 05:36:02,995 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 05:36:02,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 05:36:02,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:36:02,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr0REQUIRES_VIOLATION [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr1REQUIRES_VIOLATION [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr2REQUIRES_VIOLATION [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr3REQUIRES_VIOLATION [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr4REQUIRES_VIOLATION [2021-08-27 05:36:03,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr5REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr6REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr7REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr8REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr9REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr10REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr11REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr12REQUIRES_VIOLATION [2021-08-27 05:36:03,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr13REQUIRES_VIOLATION [2021-08-27 05:36:03,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-27 05:36:03,005 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:36:03,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:36:03 BoogieIcfgContainer [2021-08-27 05:36:03,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:36:03,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:36:03,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:36:03,029 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:36:03,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:25:45" (3/4) ... [2021-08-27 05:36:03,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 05:36:03,073 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 05:36:03,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:36:03,074 INFO L168 Benchmark]: Toolchain (without parser) took 618428.00 ms. Allocated memory was 56.6 MB in the beginning and 419.4 MB in the end (delta: 362.8 MB). Free memory was 33.2 MB in the beginning and 157.1 MB in the end (delta: -123.9 MB). Peak memory consumption was 239.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:36:03,074 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 38.5 MB in the beginning and 38.4 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:36:03,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.56 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 33.0 MB in the beginning and 61.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-08-27 05:36:03,074 INFO L168 Benchmark]: Boogie Preprocessor took 34.05 ms. Allocated memory is still 83.9 MB. Free memory was 61.3 MB in the beginning and 58.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:36:03,075 INFO L168 Benchmark]: RCFGBuilder took 529.52 ms. Allocated memory is still 83.9 MB. Free memory was 58.3 MB in the beginning and 51.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 16.1 GB. [2021-08-27 05:36:03,075 INFO L168 Benchmark]: TraceAbstraction took 617486.16 ms. Allocated memory was 83.9 MB in the beginning and 419.4 MB in the end (delta: 335.5 MB). Free memory was 51.2 MB in the beginning and 160.3 MB in the end (delta: -109.1 MB). Peak memory consumption was 224.9 MB. Max. memory is 16.1 GB. [2021-08-27 05:36:03,075 INFO L168 Benchmark]: Witness Printer took 44.87 ms. Allocated memory is still 419.4 MB. Free memory was 160.3 MB in the beginning and 157.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:36:03,076 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 38.5 MB in the beginning and 38.4 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 327.56 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 33.0 MB in the beginning and 61.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.05 ms. Allocated memory is still 83.9 MB. Free memory was 61.3 MB in the beginning and 58.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 529.52 ms. Allocated memory is still 83.9 MB. Free memory was 58.3 MB in the beginning and 51.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 617486.16 ms. Allocated memory was 83.9 MB in the beginning and 419.4 MB in the end (delta: 335.5 MB). Free memory was 51.2 MB in the beginning and 160.3 MB in the end (delta: -109.1 MB). Peak memory consumption was 224.9 MB. Max. memory is 16.1 GB. * Witness Printer took 44.87 ms. Allocated memory is still 419.4 MB. Free memory was 160.3 MB in the beginning and 157.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 552]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L539] struct item *list = ((void *)0); VAL [list={3:0}] [L541] CALL append(&list) VAL [plist={3:0}] [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={-4:0}, plist={3:0}, plist={3:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={-4:0}, plist={3:0}, plist={3:0}] [L532] EXPR item->next VAL [item={-4:0}, item->next={0:0}, plist={3:0}, plist={3:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-3:0}, item={-4:0}, item->next={0:0}, malloc(sizeof *item)={-3:0}, plist={3:0}, plist={3:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-3:0}, item={-4:0}, item->next={0:0}, malloc(sizeof *item)={-3:0}, plist={3:0}, plist={3:0}] [L535] *plist = item VAL [item={-4:0}, plist={3:0}, plist={3:0}] [L541] RET append(&list) VAL [list={3:0}] [L542] COND TRUE __VERIFIER_nondet_int() [L541] CALL append(&list) VAL [plist={3:0}] [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={-4:0}, item={-2:0}, plist={3:0}, plist={3:0}] [L531] item->next = *plist VAL [\read(**plist)={-4:0}, item={-2:0}, plist={3:0}, plist={3:0}] [L532] EXPR item->next VAL [item={-2:0}, item->next={-4:0}, plist={3:0}, plist={3:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [item={-2:0}, item->next={-4:0}, plist={3:0}, plist={3:0}] [L533] EXPR item->next VAL [item={-2:0}, item->next={-4:0}, item->next={-4:0}, plist={3:0}, plist={3:0}] [L533] EXPR item->next->data VAL [item={-2:0}, item->next={-4:0}, item->next={-4:0}, item->next->data={-3:0}, plist={3:0}, plist={3:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-3:0}, item={-2:0}, item->next={-4:0}, item->next={-4:0}, item->next->data={-3:0}, plist={3:0}, plist={3:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-3:0}, item={-2:0}, item->next={-4:0}, item->next={-4:0}, item->next->data={-3:0}, plist={3:0}, plist={3:0}] [L535] *plist = item VAL [item={-2:0}, plist={3:0}, plist={3:0}] [L541] RET append(&list) VAL [list={3:0}] [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={-2:0}, list={3:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={-2:0}, list={3:0}] [L544] EXPR list->next VAL [\read(*list)={-2:0}, list={3:0}, list->next={-4:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={-2:0}, list={3:0}, next={-4:0}] [L545] EXPR list->data VAL [\read(*list)={-2:0}, list={3:0}, list->data={-3:0}, next={-4:0}] [L545] free(list->data) VAL [\read(*list)={-2:0}, list={3:0}, list->data={-3:0}, next={-4:0}] [L545] free(list->data) VAL [\read(*list)={-2:0}, list={3:0}, list->data={-3:0}, next={-4:0}] [L545] free(list->data) [L546] EXPR \read(*list) VAL [\read(*list)={-2:0}, list={3:0}, next={-4:0}] [L546] free(list) VAL [\read(*list)={-2:0}, list={3:0}, next={-4:0}] [L546] free(list) VAL [\read(*list)={-2:0}, list={3:0}, next={-4:0}] [L546] free(list) [L547] list = next VAL [list={3:0}, next={-4:0}] [L549] \read(*list) VAL [\read(*list)={-4:0}, list={3:0}, next={-4:0}] [L549] COND TRUE \read(*list) [L550] EXPR \read(*list) VAL [\read(*list)={-4:0}, list={3:0}, next={-4:0}] [L550] EXPR list->next VAL [\read(*list)={-4:0}, list={3:0}, list->next={0:0}, next={-4:0}] [L550] struct item *next = list->next; [L551] COND TRUE !next VAL [list={3:0}, next={-4:0}, next={0:0}] [L552] EXPR \read(*list) VAL [\read(*list)={-4:0}, list={3:0}, next={0:0}, next={-4:0}] [L552] EXPR list->data VAL [\read(*list)={-4:0}, list={3:0}, list->data={-3:0}, next={0:0}, next={-4:0}] [L552] free(list->data) VAL [\read(*list)={-4:0}, list={3:0}, list->data={-3:0}, next={-4:0}, next={0:0}] [L552] free(list->data) VAL [\read(*list)={-4:0}, list={3:0}, list->data={-3:0}, next={-4:0}, next={0:0}] [L552] free(list->data) VAL [\read(*list)={-4:0}, list={3:0}, list->data={-3:0}, next={0:0}, next={-4:0}] - UnprovableResult [Line: 543]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 132 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 617428.8ms, OverallIterations: 44, TraceHistogramMax: 2, EmptinessCheckTime: 23.6ms, AutomataDifference: 455035.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2318 SDtfs, 5922 SDslu, 15977 SDs, 0 SdLazy, 28020 SolverSat, 1257 SolverUnsat, 166 SolverUnknown, 0 SolverNotchecked, 257862.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1967 GetRequests, 700 SyntacticMatches, 13 SemanticMatches, 1254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15192 ImplicationChecksByTransitivity, 319476.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=25, InterpolantAutomatonStates: 734, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 145.5ms AutomataMinimizationTime, 43 MinimizatonAttempts, 549 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 274.8ms SsaConstructionTime, 932.4ms SatisfiabilityAnalysisTime, 147231.1ms InterpolantComputationTime, 2466 NumberOfCodeBlocks, 2466 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2344 ConstructedInterpolants, 129 QuantifiedInterpolants, 55343 SizeOfPredicates, 373 NumberOfNonLiveVariables, 5196 ConjunctsInSsa, 1068 ConjunctsInUnsatCore, 59 InterpolantComputations, 27 PerfectInterpolantSequences, 198/462 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 05:36:03,308 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-27 05:36:03,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...