./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 760c75961baa7cc196b373809e9a87dd0bcf8eb7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 18:57:23,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 18:57:23,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 18:57:23,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 18:57:23,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 18:57:23,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 18:57:23,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 18:57:23,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 18:57:23,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 18:57:23,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 18:57:23,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 18:57:23,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 18:57:23,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 18:57:23,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 18:57:23,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 18:57:23,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 18:57:23,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 18:57:23,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 18:57:23,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 18:57:23,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 18:57:23,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 18:57:23,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 18:57:23,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 18:57:23,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 18:57:23,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 18:57:23,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 18:57:23,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 18:57:23,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 18:57:23,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 18:57:23,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 18:57:23,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 18:57:23,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 18:57:23,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 18:57:23,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 18:57:23,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 18:57:23,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 18:57:23,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 18:57:23,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 18:57:23,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 18:57:23,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 18:57:23,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 18:57:23,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-30 18:57:23,858 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 18:57:23,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 18:57:23,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 18:57:23,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 18:57:23,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 18:57:23,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 18:57:23,861 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 18:57:23,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 18:57:23,861 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 18:57:23,861 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 18:57:23,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 18:57:23,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 18:57:23,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 18:57:23,862 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 18:57:23,862 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 18:57:23,863 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 18:57:23,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 18:57:23,863 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 18:57:23,863 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 18:57:23,863 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 18:57:23,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 18:57:23,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 18:57:23,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 18:57:23,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 18:57:23,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 18:57:23,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 18:57:23,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 18:57:23,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 18:57:23,865 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 18:57:23,865 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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2021-08-30 18:57:24,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 18:57:24,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 18:57:24,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 18:57:24,163 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 18:57:24,163 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 18:57:24,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2021-08-30 18:57:24,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f779bf16/2be8e725387a42a9ad1265fde31a0eb2/FLAGc2bf5be60 [2021-08-30 18:57:24,613 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 18:57:24,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2021-08-30 18:57:24,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f779bf16/2be8e725387a42a9ad1265fde31a0eb2/FLAGc2bf5be60 [2021-08-30 18:57:24,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f779bf16/2be8e725387a42a9ad1265fde31a0eb2 [2021-08-30 18:57:24,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 18:57:24,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 18:57:24,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 18:57:24,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 18:57:24,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 18:57:24,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:24,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aea2c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24, skipping insertion in model container [2021-08-30 18:57:24,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:24,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 18:57:24,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 18:57:24,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 18:57:24,932 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 18:57:24,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 18:57:24,994 INFO L208 MainTranslator]: Completed translation [2021-08-30 18:57:24,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24 WrapperNode [2021-08-30 18:57:24,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 18:57:24,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 18:57:24,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 18:57:24,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 18:57:25,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 18:57:25,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 18:57:25,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 18:57:25,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 18:57:25,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (1/1) ... [2021-08-30 18:57:25,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 18:57:25,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:57:25,110 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-30 18:57:25,129 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-30 18:57:25,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 18:57:25,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 18:57:25,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-30 18:57:25,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-30 18:57:25,140 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-08-30 18:57:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2021-08-30 18:57:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2021-08-30 18:57:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 18:57:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-30 18:57:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-30 18:57:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-30 18:57:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-30 18:57:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-30 18:57:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-30 18:57:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-30 18:57:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-30 18:57:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-30 18:57:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-30 18:57:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-30 18:57:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-30 18:57:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-30 18:57:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-30 18:57:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-30 18:57:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-30 18:57:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-30 18:57:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-30 18:57:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-30 18:57:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-30 18:57:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-30 18:57:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-30 18:57:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-30 18:57:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-30 18:57:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-30 18:57:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-30 18:57:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-30 18:57:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-30 18:57:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-30 18:57:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-30 18:57:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-30 18:57:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-30 18:57:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-30 18:57:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-30 18:57:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-30 18:57:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-30 18:57:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-30 18:57:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-30 18:57:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-30 18:57:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-30 18:57:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-30 18:57:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-30 18:57:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-30 18:57:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-30 18:57:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-30 18:57:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-30 18:57:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-30 18:57:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-30 18:57:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-30 18:57:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-30 18:57:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-30 18:57:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-30 18:57:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-08-30 18:57:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2021-08-30 18:57:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-30 18:57:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-30 18:57:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2021-08-30 18:57:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-30 18:57:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 18:57:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 18:57:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 18:57:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 18:57:25,444 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-08-30 18:57:25,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 18:57:25,454 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-30 18:57:25,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:57:25 BoogieIcfgContainer [2021-08-30 18:57:25,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 18:57:25,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 18:57:25,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 18:57:25,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 18:57:25,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 06:57:24" (1/3) ... [2021-08-30 18:57:25,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e31c50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:57:25, skipping insertion in model container [2021-08-30 18:57:25,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:57:24" (2/3) ... [2021-08-30 18:57:25,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e31c50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:57:25, skipping insertion in model container [2021-08-30 18:57:25,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:57:25" (3/3) ... [2021-08-30 18:57:25,466 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2021-08-30 18:57:25,473 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 18:57:25,478 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2021-08-30 18:57:25,516 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 18:57:25,523 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-30 18:57:25,524 INFO L340 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2021-08-30 18:57:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 76 states have (on average 1.894736842105263) internal successors, (144), 136 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 18:57:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 18:57:25,545 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:25,545 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:25,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting dll_circular_createErr0REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash 336039556, now seen corresponding path program 1 times [2021-08-30 18:57:25,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:25,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093927315] [2021-08-30 18:57:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:25,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:25,754 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-30 18:57:25,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:25,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093927315] [2021-08-30 18:57:25,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093927315] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:25,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:25,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 18:57:25,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541231155] [2021-08-30 18:57:25,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 18:57:25,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 18:57:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:25,780 INFO L87 Difference]: Start difference. First operand has 146 states, 76 states have (on average 1.894736842105263) internal successors, (144), 136 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-30 18:57:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:26,057 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2021-08-30 18:57:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 18:57:26,059 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-30 18:57:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:26,064 INFO L225 Difference]: With dead ends: 143 [2021-08-30 18:57:26,064 INFO L226 Difference]: Without dead ends: 136 [2021-08-30 18:57:26,065 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.54ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:26,067 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 194.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.66ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 240.70ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:26,068 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 18 Invalid, 377 Unknown, 0 Unchecked, 6.66ms Time], IncrementalHoareTripleChecker [9 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 240.70ms Time] [2021-08-30 18:57:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-30 18:57:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-08-30 18:57:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 128 states have internal predecessors, (134), 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-30 18:57:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2021-08-30 18:57:26,093 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 10 [2021-08-30 18:57:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:26,094 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2021-08-30 18:57:26,094 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-30 18:57:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2021-08-30 18:57:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 18:57:26,094 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:26,095 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:26,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 18:57:26,095 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting dll_circular_createErr1REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 336039557, now seen corresponding path program 1 times [2021-08-30 18:57:26,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:26,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327899813] [2021-08-30 18:57:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:26,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,136 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-30 18:57:26,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:26,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327899813] [2021-08-30 18:57:26,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327899813] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:26,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:26,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 18:57:26,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819573169] [2021-08-30 18:57:26,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 18:57:26,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 18:57:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:26,139 INFO L87 Difference]: Start difference. First operand 136 states and 141 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-30 18:57:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:26,352 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2021-08-30 18:57:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 18:57:26,353 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-30 18:57:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:26,357 INFO L225 Difference]: With dead ends: 133 [2021-08-30 18:57:26,358 INFO L226 Difference]: Without dead ends: 133 [2021-08-30 18:57:26,358 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.84ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:26,362 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 139.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.20ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 191.17ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:26,363 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 15 Invalid, 351 Unknown, 0 Unchecked, 6.20ms Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 191.17ms Time] [2021-08-30 18:57:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-30 18:57:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-08-30 18:57:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 125 states have internal predecessors, (131), 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-30 18:57:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2021-08-30 18:57:26,374 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 10 [2021-08-30 18:57:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:26,375 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2021-08-30 18:57:26,375 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-30 18:57:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2021-08-30 18:57:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 18:57:26,375 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:26,375 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:26,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 18:57:26,376 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting dll_circular_createErr4REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452530, now seen corresponding path program 1 times [2021-08-30 18:57:26,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:26,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996037207] [2021-08-30 18:57:26,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:26,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,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-30 18:57:26,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:26,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996037207] [2021-08-30 18:57:26,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996037207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:26,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:26,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 18:57:26,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966477138] [2021-08-30 18:57:26,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 18:57:26,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:26,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 18:57:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:26,424 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-30 18:57:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:26,654 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2021-08-30 18:57:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 18:57:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2021-08-30 18:57:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:26,656 INFO L225 Difference]: With dead ends: 140 [2021-08-30 18:57:26,656 INFO L226 Difference]: Without dead ends: 140 [2021-08-30 18:57:26,656 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.94ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:26,657 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 186.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.91ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 220.54ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:26,657 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 376 Unknown, 0 Unchecked, 1.91ms Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 220.54ms Time] [2021-08-30 18:57:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-30 18:57:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2021-08-30 18:57:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.7808219178082192) internal successors, (130), 124 states have internal predecessors, (130), 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-30 18:57:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2021-08-30 18:57:26,666 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 15 [2021-08-30 18:57:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:26,666 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2021-08-30 18:57:26,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-30 18:57:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2021-08-30 18:57:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 18:57:26,667 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:26,667 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:26,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-30 18:57:26,668 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting dll_circular_createErr5REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452529, now seen corresponding path program 1 times [2021-08-30 18:57:26,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:26,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922446476] [2021-08-30 18:57:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:26,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,707 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-30 18:57:26,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:26,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922446476] [2021-08-30 18:57:26,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922446476] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:26,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:26,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 18:57:26,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203025227] [2021-08-30 18:57:26,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 18:57:26,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 18:57:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:26,709 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-30 18:57:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:26,891 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2021-08-30 18:57:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 18:57:26,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2021-08-30 18:57:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:26,892 INFO L225 Difference]: With dead ends: 139 [2021-08-30 18:57:26,893 INFO L226 Difference]: Without dead ends: 139 [2021-08-30 18:57:26,893 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.83ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:57:26,901 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 132.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.68ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 171.16ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:26,902 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 373 Unknown, 0 Unchecked, 2.68ms Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 171.16ms Time] [2021-08-30 18:57:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-30 18:57:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2021-08-30 18:57:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 123 states have internal predecessors, (129), 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-30 18:57:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2021-08-30 18:57:26,913 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 15 [2021-08-30 18:57:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:26,914 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2021-08-30 18:57:26,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-30 18:57:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2021-08-30 18:57:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 18:57:26,915 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:26,915 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:26,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-30 18:57:26,915 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting dll_circular_createErr10REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:26,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1885454067, now seen corresponding path program 1 times [2021-08-30 18:57:26,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:26,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458079578] [2021-08-30 18:57:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:26,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:26,973 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-30 18:57:26,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:26,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458079578] [2021-08-30 18:57:26,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458079578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:26,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:26,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 18:57:26,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983980329] [2021-08-30 18:57:26,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 18:57:26,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:26,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 18:57:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 18:57:26,976 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-30 18:57:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:27,182 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2021-08-30 18:57:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 18:57:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2021-08-30 18:57:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:27,183 INFO L225 Difference]: With dead ends: 139 [2021-08-30 18:57:27,184 INFO L226 Difference]: Without dead ends: 139 [2021-08-30 18:57:27,184 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 13.35ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 18:57:27,184 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 159.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.08ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 194.99ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:27,185 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 19 Invalid, 493 Unknown, 0 Unchecked, 4.08ms Time], IncrementalHoareTripleChecker [11 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 194.99ms Time] [2021-08-30 18:57:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-30 18:57:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2021-08-30 18:57:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 129 states have internal predecessors, (138), 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-30 18:57:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2021-08-30 18:57:27,189 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 15 [2021-08-30 18:57:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:27,189 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2021-08-30 18:57:27,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-30 18:57:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2021-08-30 18:57:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 18:57:27,190 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:27,190 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:27,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-30 18:57:27,190 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting dll_circular_createErr11REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1885454066, now seen corresponding path program 1 times [2021-08-30 18:57:27,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:27,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403224177] [2021-08-30 18:57:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:27,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:27,228 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-30 18:57:27,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:27,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403224177] [2021-08-30 18:57:27,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403224177] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:27,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:27,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-30 18:57:27,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542205867] [2021-08-30 18:57:27,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 18:57:27,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 18:57:27,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 18:57:27,229 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 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-30 18:57:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:27,467 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-08-30 18:57:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 18:57:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 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-30 18:57:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:27,469 INFO L225 Difference]: With dead ends: 137 [2021-08-30 18:57:27,469 INFO L226 Difference]: Without dead ends: 137 [2021-08-30 18:57:27,469 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 29.96ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-30 18:57:27,470 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 163.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 206.51ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:27,470 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 24 Invalid, 598 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 206.51ms Time] [2021-08-30 18:57:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-30 18:57:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-08-30 18:57:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 127 states have internal predecessors, (134), 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-30 18:57:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2021-08-30 18:57:27,473 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 15 [2021-08-30 18:57:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:27,474 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2021-08-30 18:57:27,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 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-30 18:57:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2021-08-30 18:57:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 18:57:27,474 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:27,474 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:27,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-30 18:57:27,475 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting dll_circular_createErr7REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1680513841, now seen corresponding path program 1 times [2021-08-30 18:57:27,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:27,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768081949] [2021-08-30 18:57:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:27,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:27,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-30 18:57:27,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:27,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768081949] [2021-08-30 18:57:27,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768081949] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:27,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:27,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 18:57:27,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378417773] [2021-08-30 18:57:27,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 18:57:27,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:27,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 18:57:27,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 18:57:27,536 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-30 18:57:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:27,747 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-08-30 18:57:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 18:57:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2021-08-30 18:57:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:27,748 INFO L225 Difference]: With dead ends: 136 [2021-08-30 18:57:27,748 INFO L226 Difference]: Without dead ends: 136 [2021-08-30 18:57:27,748 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.11ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 18:57:27,749 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 146.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.75ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 194.62ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:27,749 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 475 Unknown, 0 Unchecked, 1.75ms Time], IncrementalHoareTripleChecker [5 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 194.62ms Time] [2021-08-30 18:57:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-30 18:57:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2021-08-30 18:57:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 127 states have internal predecessors, (133), 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-30 18:57:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2021-08-30 18:57:27,752 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 16 [2021-08-30 18:57:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:27,756 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2021-08-30 18:57:27,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-30 18:57:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2021-08-30 18:57:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 18:57:27,757 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:27,757 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:27,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-30 18:57:27,757 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting dll_circular_createErr10REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash -901390365, now seen corresponding path program 1 times [2021-08-30 18:57:27,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:27,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106404011] [2021-08-30 18:57:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:27,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:27,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:27,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106404011] [2021-08-30 18:57:27,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106404011] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:27,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:27,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 18:57:27,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76649852] [2021-08-30 18:57:27,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 18:57:27,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:27,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 18:57:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 18:57:27,810 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-30 18:57:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:28,019 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2021-08-30 18:57:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 18:57:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2021-08-30 18:57:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:28,020 INFO L225 Difference]: With dead ends: 133 [2021-08-30 18:57:28,020 INFO L226 Difference]: Without dead ends: 133 [2021-08-30 18:57:28,021 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.48ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 18:57:28,021 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 157.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.57ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 197.82ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:28,021 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 19 Invalid, 479 Unknown, 0 Unchecked, 1.57ms Time], IncrementalHoareTripleChecker [8 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 197.82ms Time] [2021-08-30 18:57:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-30 18:57:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-08-30 18:57:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 77 states have (on average 1.7012987012987013) internal successors, (131), 125 states have internal predecessors, (131), 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-30 18:57:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2021-08-30 18:57:28,024 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 20 [2021-08-30 18:57:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:28,028 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2021-08-30 18:57:28,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-30 18:57:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2021-08-30 18:57:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 18:57:28,029 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:28,029 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:28,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-30 18:57:28,030 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting dll_circular_createErr11REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash -901390364, now seen corresponding path program 1 times [2021-08-30 18:57:28,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:28,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931690163] [2021-08-30 18:57:28,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:28,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:28,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:28,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931690163] [2021-08-30 18:57:28,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931690163] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:57:28,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419258326] [2021-08-30 18:57:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:28,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:57:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:57:28,104 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-30 18:57:28,138 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-30 18:57:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:28,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-30 18:57:28,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:57:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:28,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:57:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:28,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419258326] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 18:57:28,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 18:57:28,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-08-30 18:57:28,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394764696] [2021-08-30 18:57:28,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 18:57:28,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 18:57:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-30 18:57:28,341 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 18:57:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:28,624 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2021-08-30 18:57:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 18:57:28,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-30 18:57:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:28,625 INFO L225 Difference]: With dead ends: 135 [2021-08-30 18:57:28,626 INFO L226 Difference]: Without dead ends: 135 [2021-08-30 18:57:28,626 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 41.80ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-30 18:57:28,627 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 65 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 202.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.39ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 251.29ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:28,627 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 30 Invalid, 711 Unknown, 0 Unchecked, 2.39ms Time], IncrementalHoareTripleChecker [9 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 251.29ms Time] [2021-08-30 18:57:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-30 18:57:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-08-30 18:57:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 79 states have (on average 1.6835443037974684) internal successors, (133), 127 states have internal predecessors, (133), 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-30 18:57:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2021-08-30 18:57:28,629 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 20 [2021-08-30 18:57:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:28,630 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2021-08-30 18:57:28,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 18:57:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2021-08-30 18:57:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-30 18:57:28,630 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:28,631 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:57:28,658 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-30 18:57:28,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:57:28,837 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting dll_circular_createErr7REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2121717531, now seen corresponding path program 1 times [2021-08-30 18:57:28,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:28,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680834815] [2021-08-30 18:57:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:28,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:28,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:28,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:28,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680834815] [2021-08-30 18:57:28,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680834815] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:57:28,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100085851] [2021-08-30 18:57:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:28,911 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:57:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:57:28,912 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-30 18:57:28,913 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-30 18:57:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:28,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 18:57:28,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:57:29,052 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-30 18:57:29,057 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-30 18:57:29,139 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:57:29,140 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 22 treesize of output 24 [2021-08-30 18:57:29,145 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 18:57:29,146 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 21 treesize of output 21 [2021-08-30 18:57:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:29,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:57:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:29,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100085851] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 18:57:29,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 18:57:29,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2021-08-30 18:57:29,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631000392] [2021-08-30 18:57:29,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-30 18:57:29,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-30 18:57:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-30 18:57:29,379 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 18:57:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:29,679 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2021-08-30 18:57:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 18:57:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-30 18:57:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:29,681 INFO L225 Difference]: With dead ends: 133 [2021-08-30 18:57:29,681 INFO L226 Difference]: Without dead ends: 133 [2021-08-30 18:57:29,681 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 116.70ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-08-30 18:57:29,681 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 174.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 234.68ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:29,682 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 835 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [8 Valid, 580 Invalid, 0 Unknown, 247 Unchecked, 234.68ms Time] [2021-08-30 18:57:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-30 18:57:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-08-30 18:57:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 125 states have internal predecessors, (131), 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-30 18:57:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2021-08-30 18:57:29,691 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 21 [2021-08-30 18:57:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:29,691 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2021-08-30 18:57:29,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 18:57:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2021-08-30 18:57:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-30 18:57:29,692 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:29,692 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:57:29,711 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-30 18:57:29,897 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,SelfDestructingSolverStorable9 [2021-08-30 18:57:29,897 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479222, now seen corresponding path program 1 times [2021-08-30 18:57:29,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:29,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040419079] [2021-08-30 18:57:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:29,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:57:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-30 18:57:29,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:29,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040419079] [2021-08-30 18:57:29,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040419079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:29,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:29,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-30 18:57:29,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728807154] [2021-08-30 18:57:29,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-30 18:57:29,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-30 18:57:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-08-30 18:57:29,987 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:30,422 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-08-30 18:57:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-30 18:57:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-08-30 18:57:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:30,423 INFO L225 Difference]: With dead ends: 130 [2021-08-30 18:57:30,423 INFO L226 Difference]: Without dead ends: 130 [2021-08-30 18:57:30,424 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.73ms TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-08-30 18:57:30,424 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 111 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 298.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.65ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 374.40ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:30,424 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 38 Invalid, 1164 Unknown, 0 Unchecked, 4.65ms Time], IncrementalHoareTripleChecker [12 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 374.40ms Time] [2021-08-30 18:57:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-08-30 18:57:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-08-30 18:57:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.620253164556962) internal successors, (128), 122 states have internal predecessors, (128), 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-30 18:57:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2021-08-30 18:57:30,427 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 32 [2021-08-30 18:57:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:30,427 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2021-08-30 18:57:30,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2021-08-30 18:57:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-30 18:57:30,428 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:30,428 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:57:30,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-30 18:57:30,428 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479221, now seen corresponding path program 1 times [2021-08-30 18:57:30,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:30,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255904764] [2021-08-30 18:57:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:30,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:57:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 18:57:30,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:30,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255904764] [2021-08-30 18:57:30,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255904764] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:30,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:30,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-30 18:57:30,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090070716] [2021-08-30 18:57:30,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-30 18:57:30,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-30 18:57:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-08-30 18:57:30,581 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:31,013 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-08-30 18:57:31,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 18:57:31,013 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-08-30 18:57:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:31,014 INFO L225 Difference]: With dead ends: 123 [2021-08-30 18:57:31,014 INFO L226 Difference]: Without dead ends: 123 [2021-08-30 18:57:31,014 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 124.51ms TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-08-30 18:57:31,015 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 238 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 280.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.27ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 344.29ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:31,015 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 29 Invalid, 986 Unknown, 0 Unchecked, 4.27ms Time], IncrementalHoareTripleChecker [19 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 344.29ms Time] [2021-08-30 18:57:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-30 18:57:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-08-30 18:57:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 115 states have internal predecessors, (121), 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-30 18:57:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2021-08-30 18:57:31,018 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 32 [2021-08-30 18:57:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:31,018 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2021-08-30 18:57:31,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2021-08-30 18:57:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 18:57:31,019 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:31,019 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:57:31,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-30 18:57:31,019 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:31,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:31,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1282426124, now seen corresponding path program 1 times [2021-08-30 18:57:31,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:31,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809600009] [2021-08-30 18:57:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:31,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:57:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:31,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:31,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809600009] [2021-08-30 18:57:31,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809600009] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:57:31,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646422583] [2021-08-30 18:57:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:31,380 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:57:31,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:57:31,381 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-30 18:57:31,383 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-30 18:57:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:31,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-30 18:57:31,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:57:31,482 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-30 18:57:31,531 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:57:31,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-30 18:57:31,637 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 18:57:31,637 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 16 treesize of output 18 [2021-08-30 18:57:31,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 18:57:31,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-30 18:57:31,888 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-30 18:57:31,888 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2021-08-30 18:57:31,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:57:31,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-30 18:57:31,971 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-30 18:57:31,971 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 48 [2021-08-30 18:57:32,398 INFO L354 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2021-08-30 18:57:32,399 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 54 treesize of output 35 [2021-08-30 18:57:32,406 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-30 18:57:32,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:57:33,033 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-30 18:57:33,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646422583] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 18:57:33,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 18:57:33,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 15] total 42 [2021-08-30 18:57:33,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531537936] [2021-08-30 18:57:33,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-08-30 18:57:33,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:33,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-08-30 18:57:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1654, Unknown=0, NotChecked=0, Total=1806 [2021-08-30 18:57:33,037 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 43 states, 40 states have (on average 1.9) internal successors, (76), 37 states have internal predecessors, (76), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:57:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:33,873 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2021-08-30 18:57:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-30 18:57:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.9) internal successors, (76), 37 states have internal predecessors, (76), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-08-30 18:57:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:33,874 INFO L225 Difference]: With dead ends: 119 [2021-08-30 18:57:33,874 INFO L226 Difference]: Without dead ends: 119 [2021-08-30 18:57:33,875 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1035.04ms TimeCoverageRelationStatistics Valid=304, Invalid=2348, Unknown=0, NotChecked=0, Total=2652 [2021-08-30 18:57:33,876 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 107 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 474.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.28ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 955 IncrementalHoareTripleChecker+Unchecked, 590.10ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:33,876 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 113 Invalid, 2779 Unknown, 0 Unchecked, 6.28ms Time], IncrementalHoareTripleChecker [39 Valid, 1785 Invalid, 0 Unknown, 955 Unchecked, 590.10ms Time] [2021-08-30 18:57:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-30 18:57:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-08-30 18:57:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.481012658227848) internal successors, (117), 111 states have internal predecessors, (117), 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-30 18:57:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2021-08-30 18:57:33,879 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 38 [2021-08-30 18:57:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:33,879 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2021-08-30 18:57:33,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.9) internal successors, (76), 37 states have internal predecessors, (76), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:57:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2021-08-30 18:57:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 18:57:33,880 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:33,880 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:57:33,899 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-30 18:57:34,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:57:34,085 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1282424908, now seen corresponding path program 1 times [2021-08-30 18:57:34,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:34,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767834004] [2021-08-30 18:57:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:34,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:57:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 18:57:34,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:34,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767834004] [2021-08-30 18:57:34,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767834004] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:34,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:34,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-30 18:57:34,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606867604] [2021-08-30 18:57:34,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 18:57:34,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:34,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 18:57:34,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-08-30 18:57:34,277 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:34,792 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2021-08-30 18:57:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-30 18:57:34,793 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-08-30 18:57:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:34,794 INFO L225 Difference]: With dead ends: 114 [2021-08-30 18:57:34,794 INFO L226 Difference]: Without dead ends: 114 [2021-08-30 18:57:34,794 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 186.96ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-08-30 18:57:34,794 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 290 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 307.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.58ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 388.06ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:34,794 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 56 Invalid, 1213 Unknown, 0 Unchecked, 3.58ms Time], IncrementalHoareTripleChecker [26 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 388.06ms Time] [2021-08-30 18:57:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-30 18:57:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-08-30 18:57:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 106 states have internal predecessors, (112), 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-30 18:57:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2021-08-30 18:57:34,797 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 38 [2021-08-30 18:57:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:34,797 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2021-08-30 18:57:34,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2021-08-30 18:57:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 18:57:34,797 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:34,797 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:57:34,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-30 18:57:34,798 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1282463890, now seen corresponding path program 1 times [2021-08-30 18:57:34,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:34,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510484845] [2021-08-30 18:57:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:34,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:57:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 18:57:34,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:34,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510484845] [2021-08-30 18:57:34,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510484845] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:57:34,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:57:34,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-30 18:57:34,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245580447] [2021-08-30 18:57:34,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-30 18:57:34,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-30 18:57:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-08-30 18:57:34,881 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:57:35,224 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2021-08-30 18:57:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 18:57:35,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-08-30 18:57:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:57:35,225 INFO L225 Difference]: With dead ends: 109 [2021-08-30 18:57:35,225 INFO L226 Difference]: Without dead ends: 109 [2021-08-30 18:57:35,225 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 79.06ms TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-08-30 18:57:35,226 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 198 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 232.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.53ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 283.04ms IncrementalHoareTripleChecker+Time [2021-08-30 18:57:35,226 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 36 Invalid, 871 Unknown, 0 Unchecked, 2.53ms Time], IncrementalHoareTripleChecker [17 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 283.04ms Time] [2021-08-30 18:57:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-30 18:57:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-08-30 18:57:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.3544303797468353) 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-30 18:57:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2021-08-30 18:57:35,228 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 38 [2021-08-30 18:57:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:57:35,228 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2021-08-30 18:57:35,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:57:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2021-08-30 18:57:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-30 18:57:35,229 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:57:35,229 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:57:35,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-30 18:57:35,229 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:57:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:57:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1100504094, now seen corresponding path program 1 times [2021-08-30 18:57:35,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:57:35,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411059601] [2021-08-30 18:57:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:35,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:57:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:57:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:57:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:35,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:57:35,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411059601] [2021-08-30 18:57:35,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411059601] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:57:35,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864350468] [2021-08-30 18:57:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:57:35,523 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:57:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:57:35,524 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-30 18:57:35,525 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-30 18:57:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:57:35,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-30 18:57:35,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:57:35,637 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-30 18:57:35,685 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 18:57:35,685 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 16 treesize of output 18 [2021-08-30 18:57:35,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 18:57:35,781 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:57:35,782 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-08-30 18:57:35,888 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:57:35,889 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 2 case distinctions, treesize of input 42 treesize of output 39 [2021-08-30 18:57:35,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:57:35,955 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 18:57:35,955 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 5 case distinctions, treesize of input 55 treesize of output 55 [2021-08-30 18:57:36,304 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 18:57:36,304 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 57 treesize of output 29 [2021-08-30 18:57:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:57:36,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:57:58,873 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-08-30 18:57:58,874 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 51 [2021-08-30 18:57:58,884 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 18:57:58,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2021-08-30 18:57:58,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-08-30 18:57:58,952 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:57:58,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:57:58,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-08-30 18:57:58,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71584759] [2021-08-30 18:57:58,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-30 18:57:58,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:57:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-30 18:57:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1014, Unknown=14, NotChecked=0, Total=1122 [2021-08-30 18:57:58,954 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:58:00,051 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2021-08-30 18:58:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-30 18:58:00,051 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2021-08-30 18:58:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:58:00,052 INFO L225 Difference]: With dead ends: 109 [2021-08-30 18:58:00,052 INFO L226 Difference]: Without dead ends: 109 [2021-08-30 18:58:00,053 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 23232.36ms TimeCoverageRelationStatistics Valid=224, Invalid=2114, Unknown=14, NotChecked=0, Total=2352 [2021-08-30 18:58:00,053 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 265 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 583.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.78ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 690.19ms IncrementalHoareTripleChecker+Time [2021-08-30 18:58:00,053 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 62 Invalid, 1791 Unknown, 0 Unchecked, 6.78ms Time], IncrementalHoareTripleChecker [47 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 690.19ms Time] [2021-08-30 18:58:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-30 18:58:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2021-08-30 18:58:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 97 states have internal predecessors, (103), 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-30 18:58:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2021-08-30 18:58:00,056 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 39 [2021-08-30 18:58:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:58:00,056 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2021-08-30 18:58:00,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2021-08-30 18:58:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-30 18:58:00,056 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:58:00,057 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:58:00,074 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-30 18:58:00,261 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,SelfDestructingSolverStorable15 [2021-08-30 18:58:00,261 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:58:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:58:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1100466360, now seen corresponding path program 1 times [2021-08-30 18:58:00,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:58:00,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811739483] [2021-08-30 18:58:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:00,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:58:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:58:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:00,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:58:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 18:58:00,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:58:00,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811739483] [2021-08-30 18:58:00,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811739483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:58:00,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:58:00,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-30 18:58:00,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904797401] [2021-08-30 18:58:00,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 18:58:00,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:58:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 18:58:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-08-30 18:58:00,452 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:58:01,028 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-08-30 18:58:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-30 18:58:01,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2021-08-30 18:58:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:58:01,029 INFO L225 Difference]: With dead ends: 100 [2021-08-30 18:58:01,029 INFO L226 Difference]: Without dead ends: 100 [2021-08-30 18:58:01,029 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 214.98ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-08-30 18:58:01,030 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 241 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 365.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.25ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 443.75ms IncrementalHoareTripleChecker+Time [2021-08-30 18:58:01,030 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 46 Invalid, 1123 Unknown, 0 Unchecked, 4.25ms Time], IncrementalHoareTripleChecker [24 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 443.75ms Time] [2021-08-30 18:58:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-30 18:58:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-08-30 18:58:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.240506329113924) internal successors, (98), 92 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-30 18:58:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2021-08-30 18:58:01,032 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 39 [2021-08-30 18:58:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:58:01,033 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2021-08-30 18:58:01,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2021-08-30 18:58:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 18:58:01,033 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:58:01,033 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:58:01,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-30 18:58:01,034 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:58:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:58:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash 244111542, now seen corresponding path program 1 times [2021-08-30 18:58:01,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:58:01,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684581839] [2021-08-30 18:58:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:01,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:58:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:58:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:58:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:01,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:58:01,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684581839] [2021-08-30 18:58:01,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684581839] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:58:01,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618160780] [2021-08-30 18:58:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:01,265 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:58:01,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:58:01,266 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-30 18:58:01,306 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-30 18:58:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:01,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-30 18:58:01,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:58:01,387 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-30 18:58:01,425 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-08-30 18:58:01,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-08-30 18:58:01,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 18:58:01,525 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:58:01,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-08-30 18:58:01,650 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:58:01,650 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 2 case distinctions, treesize of input 42 treesize of output 39 [2021-08-30 18:58:01,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:58:01,721 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 18:58:01,721 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 5 case distinctions, treesize of input 60 treesize of output 60 [2021-08-30 18:58:02,154 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 18:58:02,154 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 71 treesize of output 39 [2021-08-30 18:58:02,317 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-30 18:58:02,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:58:02,659 INFO L354 Elim1Store]: treesize reduction 93, result has 22.5 percent of original size [2021-08-30 18:58:02,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 1 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 41 [2021-08-30 18:58:02,674 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-08-30 18:58:02,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2021-08-30 18:58:02,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-08-30 18:58:02,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-08-30 18:58:02,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:58:02,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:58:02,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-08-30 18:58:02,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333351899] [2021-08-30 18:58:02,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-30 18:58:02,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:58:02,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-30 18:58:02,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2021-08-30 18:58:02,713 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:58:03,531 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2021-08-30 18:58:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-30 18:58:03,531 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-08-30 18:58:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:58:03,532 INFO L225 Difference]: With dead ends: 103 [2021-08-30 18:58:03,532 INFO L226 Difference]: Without dead ends: 103 [2021-08-30 18:58:03,532 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 948.45ms TimeCoverageRelationStatistics Valid=210, Invalid=1952, Unknown=0, NotChecked=0, Total=2162 [2021-08-30 18:58:03,533 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 90 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 452.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.25ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 559.10ms IncrementalHoareTripleChecker+Time [2021-08-30 18:58:03,533 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 68 Invalid, 1741 Unknown, 0 Unchecked, 4.25ms Time], IncrementalHoareTripleChecker [37 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 559.10ms Time] [2021-08-30 18:58:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-30 18:58:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2021-08-30 18:58:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 91 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-30 18:58:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-08-30 18:58:03,535 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2021-08-30 18:58:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:58:03,536 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-08-30 18:58:03,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-08-30 18:58:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 18:58:03,536 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:58:03,536 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:58:03,556 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-30 18:58:03,748 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,SelfDestructingSolverStorable17 [2021-08-30 18:58:03,749 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:58:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:58:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash 245281334, now seen corresponding path program 1 times [2021-08-30 18:58:03,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:58:03,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179819748] [2021-08-30 18:58:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:03,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:58:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:03,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:58:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:58:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 18:58:03,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:58:03,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179819748] [2021-08-30 18:58:03,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179819748] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 18:58:03,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:58:03,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-30 18:58:03,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6924190] [2021-08-30 18:58:03,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 18:58:03,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:58:03,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 18:58:03,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-08-30 18:58:03,919 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:58:04,391 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-08-30 18:58:04,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-30 18:58:04,391 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-08-30 18:58:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:58:04,392 INFO L225 Difference]: With dead ends: 98 [2021-08-30 18:58:04,392 INFO L226 Difference]: Without dead ends: 98 [2021-08-30 18:58:04,392 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 192.19ms TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-08-30 18:58:04,392 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 82 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 283.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.80ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 344.79ms IncrementalHoareTripleChecker+Time [2021-08-30 18:58:04,392 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 1087 Unknown, 0 Unchecked, 2.80ms Time], IncrementalHoareTripleChecker [10 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 344.79ms Time] [2021-08-30 18:58:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-30 18:58:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-08-30 18:58:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 90 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-30 18:58:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-08-30 18:58:04,395 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 40 [2021-08-30 18:58:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:58:04,395 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-08-30 18:58:04,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-08-30 18:58:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-30 18:58:04,396 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:58:04,396 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:58:04,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-30 18:58:04,396 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:58:04,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:58:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2033890821, now seen corresponding path program 1 times [2021-08-30 18:58:04,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:58:04,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072431490] [2021-08-30 18:58:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:04,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:58:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:58:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:58:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:04,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:58:04,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072431490] [2021-08-30 18:58:04,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072431490] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:58:04,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598078854] [2021-08-30 18:58:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:04,634 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:58:04,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:58:04,637 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-30 18:58:04,668 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-30 18:58:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:04,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-30 18:58:04,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:58:04,766 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 18:58:04,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-30 18:58:04,793 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 21 treesize of output 17 [2021-08-30 18:58:04,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 18:58:04,922 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 27 treesize of output 23 [2021-08-30 18:58:05,107 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:58:05,109 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-30 18:58:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:05,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:58:05,366 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 14 treesize of output 12 [2021-08-30 18:58:05,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-08-30 18:58:05,375 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 13 treesize of output 11 [2021-08-30 18:58:05,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-08-30 18:58:05,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-08-30 18:58:05,440 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 18:58:05,440 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 13 treesize of output 12 [2021-08-30 18:58:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:05,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598078854] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 18:58:05,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 18:58:05,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 32 [2021-08-30 18:58:05,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557848431] [2021-08-30 18:58:05,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-30 18:58:05,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:58:05,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-30 18:58:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2021-08-30 18:58:05,466 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:58:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:58:06,335 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-08-30 18:58:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-30 18:58:06,336 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2021-08-30 18:58:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:58:06,336 INFO L225 Difference]: With dead ends: 97 [2021-08-30 18:58:06,336 INFO L226 Difference]: Without dead ends: 97 [2021-08-30 18:58:06,337 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 690.11ms TimeCoverageRelationStatistics Valid=199, Invalid=1693, Unknown=0, NotChecked=0, Total=1892 [2021-08-30 18:58:06,337 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 136 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 486.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.53ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 586.40ms IncrementalHoareTripleChecker+Time [2021-08-30 18:58:06,338 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 89 Invalid, 1934 Unknown, 0 Unchecked, 4.53ms Time], IncrementalHoareTripleChecker [24 Valid, 1812 Invalid, 0 Unknown, 98 Unchecked, 586.40ms Time] [2021-08-30 18:58:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-30 18:58:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-08-30 18:58:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 89 states have internal predecessors, (95), 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-30 18:58:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2021-08-30 18:58:06,340 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 43 [2021-08-30 18:58:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:58:06,340 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2021-08-30 18:58:06,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:58:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2021-08-30 18:58:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-30 18:58:06,341 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:58:06,341 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:58:06,361 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-30 18:58:06,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:58:06,556 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:58:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:58:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2033459845, now seen corresponding path program 1 times [2021-08-30 18:58:06,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:58:06,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480043628] [2021-08-30 18:58:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:06,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:58:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:06,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:58:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:58:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:06,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:58:06,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480043628] [2021-08-30 18:58:06,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480043628] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:58:06,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980581310] [2021-08-30 18:58:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:06,838 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:58:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:58:06,840 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-30 18:58:06,876 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-30 18:58:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:06,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-30 18:58:06,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:58:06,955 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-30 18:58:06,984 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:58:06,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-30 18:58:07,022 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 18:58:07,023 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 16 treesize of output 18 [2021-08-30 18:58:07,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 18:58:07,077 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:58:07,077 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-08-30 18:58:07,166 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:58:07,166 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 2 case distinctions, treesize of input 42 treesize of output 39 [2021-08-30 18:58:07,249 INFO L354 Elim1Store]: treesize reduction 116, result has 20.5 percent of original size [2021-08-30 18:58:07,250 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 6 case distinctions, treesize of input 60 treesize of output 66 [2021-08-30 18:58:08,853 INFO L354 Elim1Store]: treesize reduction 104, result has 21.8 percent of original size [2021-08-30 18:58:08,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 71 [2021-08-30 18:58:09,134 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:58:09,134 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-30 18:58:09,180 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-30 18:58:09,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:58:26,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int) (dll_circular_create_~head~0.offset Int)) (or (= (select (store |c_#valid| c_dll_circular_create_~head~0.base 0) (select (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset)) 1) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:58:27,093 INFO L354 Elim1Store]: treesize reduction 8, result has 91.9 percent of original size [2021-08-30 18:58:27,094 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 103 treesize of output 150 [2021-08-30 18:58:29,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((v_dll_circular_create_~head~0.offset_55 Int) (dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (not (= c_dll_circular_create_~new_head~0.base (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ v_dll_circular_create_~head~0.offset_55 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset)))) (forall ((v_dll_circular_create_~head~0.offset_55 Int) (dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (let ((.cse1 (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse2 c_dll_circular_create_~last~0.base (store (select .cse2 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ v_dll_circular_create_~head~0.offset_55 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset))) (or (= c_dll_circular_create_~head~0.base .cse1) (and (not (= c_dll_circular_create_~new_head~0.base .cse1)) (= c_dll_circular_create_~last~0.base .cse1)))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:58:29,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:58:29,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:58:29,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-08-30 18:58:29,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443589822] [2021-08-30 18:58:29,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-30 18:58:29,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:58:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-30 18:58:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1865, Unknown=4, NotChecked=174, Total=2162 [2021-08-30 18:58:29,261 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:58:30,266 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-08-30 18:58:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-30 18:58:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2021-08-30 18:58:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:58:30,267 INFO L225 Difference]: With dead ends: 100 [2021-08-30 18:58:30,267 INFO L226 Difference]: Without dead ends: 100 [2021-08-30 18:58:30,268 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 20755.29ms TimeCoverageRelationStatistics Valid=248, Invalid=3178, Unknown=4, NotChecked=230, Total=3660 [2021-08-30 18:58:30,268 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 99 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 450.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.17ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 540.98ms IncrementalHoareTripleChecker+Time [2021-08-30 18:58:30,268 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 68 Invalid, 1665 Unknown, 0 Unchecked, 3.17ms Time], IncrementalHoareTripleChecker [37 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 540.98ms Time] [2021-08-30 18:58:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-30 18:58:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2021-08-30 18:58:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 88 states have internal predecessors, (94), 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-30 18:58:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-08-30 18:58:30,270 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2021-08-30 18:58:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:58:30,271 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-08-30 18:58:30,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-08-30 18:58:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 18:58:30,271 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:58:30,271 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:58:30,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-08-30 18:58:30,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:58:30,483 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:58:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:58:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash -694753286, now seen corresponding path program 1 times [2021-08-30 18:58:30,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:58:30,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293158895] [2021-08-30 18:58:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:30,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:58:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:58:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:58:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:30,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:58:30,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293158895] [2021-08-30 18:58:30,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293158895] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:58:30,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172775334] [2021-08-30 18:58:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:30,956 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:58:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:58:30,957 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-30 18:58:30,957 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-30 18:58:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:31,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 56 conjunts are in the unsatisfiable core [2021-08-30 18:58:31,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:58:31,051 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-30 18:58:31,102 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-30 18:58:31,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-30 18:58:31,218 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-08-30 18:58:31,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-08-30 18:58:31,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-30 18:58:31,302 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:58:31,302 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-08-30 18:58:31,398 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:58:31,398 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 2 case distinctions, treesize of input 41 treesize of output 38 [2021-08-30 18:58:31,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:58:31,468 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 18:58:31,469 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 5 case distinctions, treesize of input 59 treesize of output 59 [2021-08-30 18:58:31,988 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 18:58:31,988 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 76 treesize of output 36 [2021-08-30 18:58:32,027 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:58:32,027 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-30 18:58:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:32,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:58:32,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-08-30 18:58:32,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~last~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) c_dll_circular_create_~head~0.offset)))) is different from false [2021-08-30 18:58:33,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~last~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) c_dll_circular_create_~new_head~0.offset)))) is different from false [2021-08-30 18:58:33,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (not (= c_dll_circular_create_~last~0.base (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) c_dll_circular_create_~new_head~0.offset)))) is different from false [2021-08-30 18:58:33,921 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-08-30 18:58:33,922 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 50 [2021-08-30 18:58:33,933 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-08-30 18:58:33,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2021-08-30 18:58:33,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-08-30 18:58:33,965 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:58:33,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:58:33,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2021-08-30 18:58:33,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777926510] [2021-08-30 18:58:33,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-30 18:58:33,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:58:33,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-30 18:58:33,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2802, Unknown=3, NotChecked=324, Total=3306 [2021-08-30 18:58:33,967 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:58:35,280 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-08-30 18:58:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-30 18:58:35,281 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2021-08-30 18:58:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:58:35,281 INFO L225 Difference]: With dead ends: 99 [2021-08-30 18:58:35,281 INFO L226 Difference]: Without dead ends: 99 [2021-08-30 18:58:35,283 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 3184.11ms TimeCoverageRelationStatistics Valid=383, Invalid=4882, Unknown=3, NotChecked=432, Total=5700 [2021-08-30 18:58:35,283 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 133 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 554.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.80ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 668.18ms IncrementalHoareTripleChecker+Time [2021-08-30 18:58:35,283 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 84 Invalid, 2038 Unknown, 0 Unchecked, 3.80ms Time], IncrementalHoareTripleChecker [45 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 668.18ms Time] [2021-08-30 18:58:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-30 18:58:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2021-08-30 18:58:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 87 states have internal predecessors, (93), 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-30 18:58:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2021-08-30 18:58:35,285 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 44 [2021-08-30 18:58:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:58:35,285 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2021-08-30 18:58:35,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:58:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2021-08-30 18:58:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 18:58:35,286 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:58:35,286 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:58:35,314 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-30 18:58:35,497 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,SelfDestructingSolverStorable21 [2021-08-30 18:58:35,498 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:58:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:58:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash -695184262, now seen corresponding path program 1 times [2021-08-30 18:58:35,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:58:35,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181216091] [2021-08-30 18:58:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:35,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:58:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:58:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:58:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:35,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:58:35,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181216091] [2021-08-30 18:58:35,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181216091] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:58:35,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426269576] [2021-08-30 18:58:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:58:35,761 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:58:35,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:58:35,765 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-30 18:58:35,792 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-30 18:58:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:58:35,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-30 18:58:35,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:58:35,863 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-30 18:58:35,910 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:58:35,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-30 18:58:35,961 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 18:58:35,962 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 16 treesize of output 18 [2021-08-30 18:58:35,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 18:58:36,007 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:58:36,008 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-08-30 18:58:36,082 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:58:36,082 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 2 case distinctions, treesize of input 33 treesize of output 34 [2021-08-30 18:58:36,142 INFO L354 Elim1Store]: treesize reduction 116, result has 20.5 percent of original size [2021-08-30 18:58:36,144 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 6 case distinctions, treesize of input 46 treesize of output 56 [2021-08-30 18:58:38,212 INFO L354 Elim1Store]: treesize reduction 104, result has 21.8 percent of original size [2021-08-30 18:58:38,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 61 [2021-08-30 18:58:38,355 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 18:58:38,356 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 21 treesize of output 27 [2021-08-30 18:58:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:58:38,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:58:40,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-08-30 18:58:41,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int) (dll_circular_create_~head~0.offset Int)) (or (not (= c_dll_circular_create_~head~0.base (select (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:58:41,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int) (dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (or (not (= c_dll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:58:42,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int) (dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (or (not (= c_dll_circular_create_~new_head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:17,426 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-08-30 18:59:17,426 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 56 [2021-08-30 18:59:17,438 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 18:59:17,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 72 [2021-08-30 18:59:17,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-08-30 18:59:17,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:59:17,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:59:17,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-08-30 18:59:17,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999371378] [2021-08-30 18:59:17,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-30 18:59:17,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:59:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-30 18:59:17,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2349, Unknown=51, NotChecked=300, Total=2862 [2021-08-30 18:59:17,500 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 22 states, 20 states have (on average 1.9) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:25,278 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-08-30 18:59:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-30 18:59:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.9) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2021-08-30 18:59:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:25,279 INFO L225 Difference]: With dead ends: 98 [2021-08-30 18:59:25,279 INFO L226 Difference]: Without dead ends: 98 [2021-08-30 18:59:25,280 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 47901.31ms TimeCoverageRelationStatistics Valid=313, Invalid=3935, Unknown=54, NotChecked=390, Total=4692 [2021-08-30 18:59:25,280 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 206 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 404.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.49ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 488.48ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:25,281 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 64 Invalid, 1569 Unknown, 0 Unchecked, 3.49ms Time], IncrementalHoareTripleChecker [51 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 488.48ms Time] [2021-08-30 18:59:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-30 18:59:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-08-30 18:59:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 86 states have internal predecessors, (92), 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-30 18:59:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-08-30 18:59:25,283 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2021-08-30 18:59:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:25,283 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-08-30 18:59:25,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.9) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-08-30 18:59:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 18:59:25,284 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:25,284 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:59:25,301 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-30 18:59:25,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:59:25,493 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1597102842, now seen corresponding path program 1 times [2021-08-30 18:59:25,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:59:25,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759835125] [2021-08-30 18:59:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:25,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:59:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:59:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:59:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:25,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:59:25,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759835125] [2021-08-30 18:59:25,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759835125] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:59:25,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923407112] [2021-08-30 18:59:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:25,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:59:25,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:59:25,689 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-30 18:59:25,694 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-30 18:59:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:25,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-30 18:59:25,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:25,810 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 18:59:25,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-30 18:59:25,835 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-30 18:59:25,920 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 18:59:25,920 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 18 treesize of output 18 [2021-08-30 18:59:26,046 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 18:59:26,046 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 21 treesize of output 27 [2021-08-30 18:59:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:26,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:26,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-08-30 18:59:26,352 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 13 treesize of output 11 [2021-08-30 18:59:26,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-08-30 18:59:26,408 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 18:59:26,409 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 13 treesize of output 12 [2021-08-30 18:59:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:26,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923407112] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 18:59:26,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 18:59:26,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2021-08-30 18:59:26,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308565726] [2021-08-30 18:59:26,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-30 18:59:26,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:59:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-30 18:59:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2021-08-30 18:59:26,430 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:59:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:27,276 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2021-08-30 18:59:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-30 18:59:27,276 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2021-08-30 18:59:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:27,277 INFO L225 Difference]: With dead ends: 95 [2021-08-30 18:59:27,277 INFO L226 Difference]: Without dead ends: 95 [2021-08-30 18:59:27,277 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 626.86ms TimeCoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2021-08-30 18:59:27,278 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 276 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 473.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.10ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 583.74ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:27,279 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 110 Invalid, 1987 Unknown, 0 Unchecked, 4.10ms Time], IncrementalHoareTripleChecker [38 Valid, 1841 Invalid, 0 Unknown, 108 Unchecked, 583.74ms Time] [2021-08-30 18:59:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-30 18:59:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2021-08-30 18:59:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 85 states have internal predecessors, (91), 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-30 18:59:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-08-30 18:59:27,281 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 44 [2021-08-30 18:59:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:27,281 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-08-30 18:59:27,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:59:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-08-30 18:59:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 18:59:27,282 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:27,282 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 18:59:27,299 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-30 18:59:27,490 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,SelfDestructingSolverStorable23 [2021-08-30 18:59:27,490 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1596671866, now seen corresponding path program 1 times [2021-08-30 18:59:27,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:59:27,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191422103] [2021-08-30 18:59:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:27,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:59:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:59:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:59:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:27,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:59:27,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191422103] [2021-08-30 18:59:27,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191422103] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:59:27,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587873870] [2021-08-30 18:59:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:27,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:59:27,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:59:27,683 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-30 18:59:27,683 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-30 18:59:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:27,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-30 18:59:27,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:27,788 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 18:59:27,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-30 18:59:27,813 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-30 18:59:27,899 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 18:59:27,899 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 18 treesize of output 18 [2021-08-30 18:59:28,037 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 18:59:28,037 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 21 treesize of output 27 [2021-08-30 18:59:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:28,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:28,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-08-30 18:59:28,334 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 13 treesize of output 11 [2021-08-30 18:59:28,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-08-30 18:59:28,383 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 18:59:28,384 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 13 treesize of output 12 [2021-08-30 18:59:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:28,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587873870] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 18:59:28,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 18:59:28,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2021-08-30 18:59:28,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195403261] [2021-08-30 18:59:28,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-30 18:59:28,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:59:28,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-30 18:59:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2021-08-30 18:59:28,404 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:59:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:29,232 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2021-08-30 18:59:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-30 18:59:29,232 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2021-08-30 18:59:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:29,233 INFO L225 Difference]: With dead ends: 94 [2021-08-30 18:59:29,233 INFO L226 Difference]: Without dead ends: 94 [2021-08-30 18:59:29,233 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 634.95ms TimeCoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2021-08-30 18:59:29,235 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 264 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 454.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.90ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 549.59ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:29,235 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 108 Invalid, 1937 Unknown, 0 Unchecked, 3.90ms Time], IncrementalHoareTripleChecker [32 Valid, 1726 Invalid, 0 Unknown, 179 Unchecked, 549.59ms Time] [2021-08-30 18:59:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-30 18:59:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2021-08-30 18:59:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.139240506329114) internal successors, (90), 84 states have internal predecessors, (90), 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-30 18:59:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2021-08-30 18:59:29,237 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 44 [2021-08-30 18:59:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:29,237 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2021-08-30 18:59:29,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 18:59:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2021-08-30 18:59:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-30 18:59:29,238 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:29,238 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:59:29,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-30 18:59:29,452 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,SelfDestructingSolverStorable24 [2021-08-30 18:59:29,453 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1757091995, now seen corresponding path program 1 times [2021-08-30 18:59:29,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:59:29,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030177843] [2021-08-30 18:59:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:29,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:59:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:59:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:29,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:59:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:30,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:59:30,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030177843] [2021-08-30 18:59:30,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030177843] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:59:30,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766619583] [2021-08-30 18:59:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:30,003 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:59:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:59:30,004 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-30 18:59:30,004 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-30 18:59:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:30,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-30 18:59:30,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:30,101 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-30 18:59:30,160 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-30 18:59:30,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-30 18:59:30,265 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-08-30 18:59:30,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-08-30 18:59:30,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-30 18:59:30,359 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:59:30,359 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-08-30 18:59:30,480 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:59:30,480 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 2 case distinctions, treesize of input 50 treesize of output 43 [2021-08-30 18:59:30,556 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-08-30 18:59:30,556 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 5 case distinctions, treesize of input 61 treesize of output 57 [2021-08-30 18:59:31,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:59:31,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:59:31,075 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-08-30 18:59:31,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 60 [2021-08-30 18:59:31,455 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:59:31,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-08-30 18:59:31,560 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-30 18:59:31,560 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 3 case distinctions, treesize of input 25 treesize of output 30 [2021-08-30 18:59:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:31,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:33,153 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base))) (let ((.cse0 (select .cse1 _destroy_in_nondeterministic_order_~head.offset))) (and (not (= .cse0 (select .cse1 (+ _destroy_in_nondeterministic_order_~head.offset 4)))) (= (select (store |c_#valid| c_dll_circular_create_~head~0.base 0) .cse0) 1)))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:34,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((dll_circular_create_~last~0.offset Int)) (= (select (store |c_#valid| c_dll_circular_create_~head~0.base 0) (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset)) 1)) (forall ((dll_circular_create_~last~0.offset Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base))) (= (select .cse0 _destroy_in_nondeterministic_order_~head.offset) (select .cse0 (+ _destroy_in_nondeterministic_order_~head.offset 4))))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:34,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((dll_circular_create_~last~0.offset Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base))) (= (select .cse0 _destroy_in_nondeterministic_order_~head.offset) (select .cse0 (+ _destroy_in_nondeterministic_order_~head.offset 4)))))) (forall ((dll_circular_create_~last~0.offset Int)) (= (select (store |c_#valid| c_dll_circular_create_~new_head~0.base 0) (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset)) 1))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:34,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:59:34,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:59:34,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-08-30 18:59:34,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653200752] [2021-08-30 18:59:34,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-30 18:59:34,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:59:34,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-30 18:59:34,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3600, Unknown=3, NotChecked=366, Total=4160 [2021-08-30 18:59:34,852 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:36,376 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-08-30 18:59:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-30 18:59:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-08-30 18:59:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:36,377 INFO L225 Difference]: With dead ends: 96 [2021-08-30 18:59:36,377 INFO L226 Difference]: Without dead ends: 96 [2021-08-30 18:59:36,378 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 4944.61ms TimeCoverageRelationStatistics Valid=421, Invalid=6068, Unknown=3, NotChecked=480, Total=6972 [2021-08-30 18:59:36,379 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 168 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 478.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.11ms SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 582.56ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:36,379 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 59 Invalid, 1607 Unknown, 0 Unchecked, 3.11ms Time], IncrementalHoareTripleChecker [67 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 582.56ms Time] [2021-08-30 18:59:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-30 18:59:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-08-30 18:59:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 82 states have internal predecessors, (88), 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-30 18:59:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2021-08-30 18:59:36,381 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2021-08-30 18:59:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:36,381 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2021-08-30 18:59:36,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2021-08-30 18:59:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-30 18:59:36,381 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:36,382 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:59:36,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-30 18:59:36,582 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,SelfDestructingSolverStorable25 [2021-08-30 18:59:36,582 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1711410025, now seen corresponding path program 1 times [2021-08-30 18:59:36,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:59:36,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059238063] [2021-08-30 18:59:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:36,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:59:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:36,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:59:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:59:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:37,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:59:37,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059238063] [2021-08-30 18:59:37,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059238063] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:59:37,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067686683] [2021-08-30 18:59:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:37,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:59:37,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:59:37,116 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-30 18:59:37,116 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-30 18:59:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:37,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-30 18:59:37,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:37,206 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-30 18:59:37,279 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-30 18:59:37,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-30 18:59:37,387 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-08-30 18:59:37,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-08-30 18:59:37,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, 3 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-30 18:59:37,471 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:59:37,472 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-08-30 18:59:37,578 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:59:37,578 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 2 case distinctions, treesize of input 41 treesize of output 38 [2021-08-30 18:59:37,649 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-08-30 18:59:37,649 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 5 case distinctions, treesize of input 57 treesize of output 57 [2021-08-30 18:59:38,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:59:38,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:59:38,166 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-08-30 18:59:38,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 60 [2021-08-30 18:59:38,494 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:59:38,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-08-30 18:59:38,581 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-30 18:59:38,581 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 3 case distinctions, treesize of input 25 treesize of output 30 [2021-08-30 18:59:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:38,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:40,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base))) (let ((.cse1 (select .cse0 (+ _destroy_in_nondeterministic_order_~head.offset 4)))) (and (not (= (select .cse0 _destroy_in_nondeterministic_order_~head.offset) .cse1)) (= (select (store |c_#valid| c_dll_circular_create_~head~0.base 0) .cse1) 1)))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:40,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 18:59:40,116 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 101 treesize of output 105 [2021-08-30 18:59:40,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4))))) (forall ((dll_circular_create_~last~0.offset Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base))) (= (select .cse0 _destroy_in_nondeterministic_order_~head.offset) (select .cse0 (+ _destroy_in_nondeterministic_order_~head.offset 4)))))) (forall ((dll_circular_create_~last~0.offset Int)) (= c_dll_circular_create_~last~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:41,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((dll_circular_create_~last~0.offset Int)) (= c_dll_circular_create_~last~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4)))) (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~new_head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4))))) (forall ((dll_circular_create_~last~0.offset Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base))) (= (select .cse0 _destroy_in_nondeterministic_order_~head.offset) (select .cse0 (+ _destroy_in_nondeterministic_order_~head.offset 4))))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:43,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4)) c_dll_circular_create_~last~0.base)) (forall ((dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (not (let ((.cse1 (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse2 c_dll_circular_create_~last~0.base (store (select .cse2 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base))) (= (select .cse1 (+ _destroy_in_nondeterministic_order_~head.offset 4)) (select .cse1 _destroy_in_nondeterministic_order_~head.offset))))) (forall ((dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (not (= c_dll_circular_create_~new_head~0.base (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse3 c_dll_circular_create_~last~0.base (store (select .cse3 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4)))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:43,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:59:43,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:59:43,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-08-30 18:59:43,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984328521] [2021-08-30 18:59:43,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-30 18:59:43,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:59:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-30 18:59:43,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3599, Unknown=4, NotChecked=492, Total=4290 [2021-08-30 18:59:43,738 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:45,289 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2021-08-30 18:59:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-30 18:59:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-08-30 18:59:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:45,290 INFO L225 Difference]: With dead ends: 92 [2021-08-30 18:59:45,290 INFO L226 Difference]: Without dead ends: 92 [2021-08-30 18:59:45,291 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 6595.84ms TimeCoverageRelationStatistics Valid=418, Invalid=6074, Unknown=4, NotChecked=644, Total=7140 [2021-08-30 18:59:45,291 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 146 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 579.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.81ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 704.54ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:45,291 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 92 Invalid, 1977 Unknown, 0 Unchecked, 3.81ms Time], IncrementalHoareTripleChecker [53 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 704.54ms Time] [2021-08-30 18:59:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-30 18:59:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2021-08-30 18:59:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 80 states have internal predecessors, (86), 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-30 18:59:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2021-08-30 18:59:45,293 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 46 [2021-08-30 18:59:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:45,293 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2021-08-30 18:59:45,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2021-08-30 18:59:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-30 18:59:45,294 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:45,294 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:59:45,313 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-30 18:59:45,500 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,SelfDestructingSolverStorable26 [2021-08-30 18:59:45,501 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash 52368473, now seen corresponding path program 1 times [2021-08-30 18:59:45,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:59:45,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248384856] [2021-08-30 18:59:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:45,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:59:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 18:59:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 18:59:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:45,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 18:59:45,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248384856] [2021-08-30 18:59:45,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248384856] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 18:59:45,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783088246] [2021-08-30 18:59:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:45,915 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:59:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:59:45,916 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-30 18:59:45,917 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-30 18:59:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:45,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-30 18:59:45,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:46,002 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-30 18:59:46,050 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 18:59:46,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-30 18:59:46,101 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 18:59:46,101 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 16 treesize of output 18 [2021-08-30 18:59:46,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 18:59:46,143 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 18:59:46,143 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 47 treesize of output 46 [2021-08-30 18:59:46,232 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 18:59:46,233 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 2 case distinctions, treesize of input 33 treesize of output 34 [2021-08-30 18:59:46,292 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-08-30 18:59:46,292 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 5 case distinctions, treesize of input 44 treesize of output 48 [2021-08-30 18:59:46,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:59:46,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 18:59:46,701 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-08-30 18:59:46,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 57 treesize of output 51 [2021-08-30 18:59:46,938 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-08-30 18:59:46,938 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 45 treesize of output 51 [2021-08-30 18:59:47,250 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-08-30 18:59:47,250 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 3 case distinctions, treesize of input 54 treesize of output 71 [2021-08-30 18:59:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:47,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:47,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2021-08-30 18:59:48,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base))) (and (not (= c_dll_circular_create_~head~0.base (select .cse0 _destroy_in_nondeterministic_order_~head.offset))) (not (= c_dll_circular_create_~head~0.base (select .cse0 (+ _destroy_in_nondeterministic_order_~head.offset 4)))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:49,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4))))) (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (+ c_dll_circular_create_~head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:50,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (and (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~new_head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4))))) (forall ((dll_circular_create_~last~0.offset Int)) (not (= c_dll_circular_create_~new_head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset))))) (< 0 _destroy_in_nondeterministic_order_~head.offset) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:52,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((_destroy_in_nondeterministic_order_~head.offset Int)) (or (< 0 _destroy_in_nondeterministic_order_~head.offset) (and (forall ((dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (not (= c_dll_circular_create_~new_head~0.base (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) _destroy_in_nondeterministic_order_~head.offset)))) (forall ((dll_circular_create_~last~0.offset Int) (dll_circular_create_~head~0.offset Int)) (not (= c_dll_circular_create_~new_head~0.base (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) c_dll_circular_create_~new_head~0.base)))) (store .cse1 c_dll_circular_create_~last~0.base (store (select .cse1 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (+ c_dll_circular_create_~new_head~0.offset 4) c_dll_circular_create_~last~0.base) (+ _destroy_in_nondeterministic_order_~head.offset 4)))))) (< _destroy_in_nondeterministic_order_~head.offset 0))) is different from false [2021-08-30 18:59:52,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 18:59:52,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-30 18:59:52,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-08-30 18:59:52,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016053712] [2021-08-30 18:59:52,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-30 18:59:52,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 18:59:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-30 18:59:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2885, Unknown=4, NotChecked=444, Total=3540 [2021-08-30 18:59:52,350 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:53,588 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-08-30 18:59:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-30 18:59:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2021-08-30 18:59:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:53,589 INFO L225 Difference]: With dead ends: 91 [2021-08-30 18:59:53,589 INFO L226 Difference]: Without dead ends: 91 [2021-08-30 18:59:53,590 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 5853.35ms TimeCoverageRelationStatistics Valid=432, Invalid=4982, Unknown=4, NotChecked=588, Total=6006 [2021-08-30 18:59:53,590 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 191 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 464.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.49ms SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 557.79ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:53,590 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 70 Invalid, 1589 Unknown, 0 Unchecked, 3.49ms Time], IncrementalHoareTripleChecker [63 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 557.79ms Time] [2021-08-30 18:59:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-30 18:59:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2021-08-30 18:59:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 79 states have internal predecessors, (85), 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-30 18:59:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2021-08-30 18:59:53,592 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 47 [2021-08-30 18:59:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:53,592 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2021-08-30 18:59:53,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 18:59:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2021-08-30 18:59:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-30 18:59:53,593 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:53,593 INFO L513 BasicCegarLoop]: trace histogram [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-30 18:59:53,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-08-30 18:59:53,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 18:59:53,801 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1824516203, now seen corresponding path program 1 times [2021-08-30 18:59:53,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 18:59:53,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996552261] [2021-08-30 18:59:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:53,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 18:59:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 18:59:53,813 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 18:59:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 18:59:53,850 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 18:59:53,850 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 18:59:53,851 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2021-08-30 18:59:53,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION (57 of 59 remaining) [2021-08-30 18:59:53,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION (56 of 59 remaining) [2021-08-30 18:59:53,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (55 of 59 remaining) [2021-08-30 18:59:53,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION (54 of 59 remaining) [2021-08-30 18:59:53,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE (53 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE (52 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE (51 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE (50 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE (49 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE (48 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE (47 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE (46 of 59 remaining) [2021-08-30 18:59:53,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE (45 of 59 remaining) [2021-08-30 18:59:53,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE (44 of 59 remaining) [2021-08-30 18:59:53,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE (43 of 59 remaining) [2021-08-30 18:59:53,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE (42 of 59 remaining) [2021-08-30 18:59:53,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE (41 of 59 remaining) [2021-08-30 18:59:53,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE (40 of 59 remaining) [2021-08-30 18:59:53,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE (39 of 59 remaining) [2021-08-30 18:59:53,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE (38 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE (37 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE (36 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE (35 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE (34 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE (33 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE (32 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE (31 of 59 remaining) [2021-08-30 18:59:53,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE (30 of 59 remaining) [2021-08-30 18:59:53,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE (29 of 59 remaining) [2021-08-30 18:59:53,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE (28 of 59 remaining) [2021-08-30 18:59:53,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE (27 of 59 remaining) [2021-08-30 18:59:53,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE (26 of 59 remaining) [2021-08-30 18:59:53,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE (25 of 59 remaining) [2021-08-30 18:59:53,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE (24 of 59 remaining) [2021-08-30 18:59:53,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE (23 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE (22 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE (21 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE (20 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE (19 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE (18 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE (17 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE (16 of 59 remaining) [2021-08-30 18:59:53,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE (15 of 59 remaining) [2021-08-30 18:59:53,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE (14 of 59 remaining) [2021-08-30 18:59:53,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2021-08-30 18:59:53,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE (12 of 59 remaining) [2021-08-30 18:59:53,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr0REQUIRES_VIOLATION (11 of 59 remaining) [2021-08-30 18:59:53,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr1REQUIRES_VIOLATION (10 of 59 remaining) [2021-08-30 18:59:53,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr2REQUIRES_VIOLATION (9 of 59 remaining) [2021-08-30 18:59:53,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr3REQUIRES_VIOLATION (8 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr4REQUIRES_VIOLATION (7 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr5REQUIRES_VIOLATION (6 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr6REQUIRES_VIOLATION (5 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr7REQUIRES_VIOLATION (4 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr8REQUIRES_VIOLATION (3 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr9REQUIRES_VIOLATION (2 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr10REQUIRES_VIOLATION (1 of 59 remaining) [2021-08-30 18:59:53,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr11REQUIRES_VIOLATION (0 of 59 remaining) [2021-08-30 18:59:53,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-30 18:59:53,864 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 18:59:53,870 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-30 18:59:53,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 06:59:53 BoogieIcfgContainer [2021-08-30 18:59:53,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 18:59:53,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 18:59:53,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 18:59:53,888 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 18:59:53,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:57:25" (3/4) ... [2021-08-30 18:59:53,890 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-30 18:59:53,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 18:59:53,891 INFO L158 Benchmark]: Toolchain (without parser) took 149257.62ms. Allocated memory was 60.8MB in the beginning and 119.5MB in the end (delta: 58.7MB). Free memory was 38.3MB in the beginning and 27.6MB in the end (delta: 10.7MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2021-08-30 18:59:53,891 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 18:59:53,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.62ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 58.6kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-30 18:59:53,891 INFO L158 Benchmark]: Boogie Preprocessor took 74.84ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-30 18:59:53,891 INFO L158 Benchmark]: RCFGBuilder took 385.41ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 46.9MB in the end (delta: -11.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2021-08-30 18:59:53,892 INFO L158 Benchmark]: TraceAbstraction took 148429.65ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 46.3MB in the beginning and 28.6MB in the end (delta: 17.7MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2021-08-30 18:59:53,892 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 119.5MB. Free memory was 28.6MB in the beginning and 27.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 18:59:53,892 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.57ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.62ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 58.6kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.84ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.41ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 46.9MB in the end (delta: -11.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 148429.65ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 46.3MB in the beginning and 28.6MB in the end (delta: 17.7MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 119.5MB. Free memory was 28.6MB in the beginning and 27.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; VAL [len=3] [L618] CALL, EXPR dll_circular_create(len) VAL [\old(len)=3] [L564] DLL last = (DLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={2:0}, len=3] [L568] last->next = last VAL [\old(len)=3, last={2:0}, len=3] [L569] last->prev = last VAL [\old(len)=3, last={2:0}, len=3] [L570] DLL head = last; VAL [\old(len)=3, head={2:0}, last={2:0}, len=3] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={2:0}, last={2:0}, len=3, new_head={-2:0}] [L576] new_head->next = head VAL [\old(len)=3, head={2:0}, last={2:0}, len=3, new_head={-2:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={2:0}, last={2:0}, len=3, new_head={-2:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={-2:0}, last={2:0}, len=2, new_head={-2:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, last={2:0}, len=2, new_head={-1:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-2:0}, last={2:0}, len=2, new_head={-1:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-2:0}, last={2:0}, len=2, new_head={-1:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={-1:0}, last={2:0}, len=1, new_head={-1:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={-1:0}, last={2:0}, len=1, new_head={-1:0}] [L581] last->next = head VAL [\old(len)=3, head={-1:0}, last={2:0}, len=1, new_head={-1:0}] [L582] head->prev = last VAL [\old(len)=3, head={-1:0}, last={2:0}, len=1, new_head={-1:0}] [L583] return head; VAL [\old(len)=3, \result={-1:0}, head={-1:0}, last={2:0}, len=1, new_head={-1:0}] [L618] RET, EXPR dll_circular_create(len) VAL [dll_circular_create(len)={-1:0}, len=3] [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) VAL [head={-1:0}] [L586] EXPR head->prev VAL [head={-1:0}, head={-1:0}, head->prev={2:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={-1:0}, head={-1:0}, head->next={-2:0}, pred={2:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={-1:0}, head={-1:0}, pred={2:0}, succ={-2:0}] [L607] free(pred) VAL [head={-1:0}, head={-1:0}, pred={2:0}, succ={-2:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={-1:0}, head={-1:0}, pred={2:0}, succ={-2:0}] [L612] free(head) VAL [head={-1:0}, head={-1:0}, pred={2:0}, succ={-2:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) VAL [head={-1:0}, len=3] [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: 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 8 procedures, 153 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 148348.37ms, OverallIterations: 29, TraceHistogramMax: 2, EmptinessCheckTime: 19.93ms, AutomataDifference: 24977.09ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 12.73ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3760 SdHoareTripleChecker+Valid, 11383.44ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3748 mSDsluCounter, 1454 SdHoareTripleChecker+Invalid, 9285.52ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1587 IncrementalHoareTripleChecker+Unchecked, 12073 mSDsCounter, 709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31830 IncrementalHoareTripleChecker+Invalid, 34126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 709 mSolverCounterUnsat, 192 mSDtfsCounter, 31830 mSolverCounterSat, 105.76ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 736 SyntacticMatches, 25 SemanticMatches, 872 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 8252 ImplicationChecksByTransitivity, 117555.26ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, InterpolantAutomatonStates: 390, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 103.85ms AutomataMinimizationTime, 28 MinimizatonAttempts, 59 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 75.57ms SsaConstructionTime, 335.92ms SatisfiabilityAnalysisTime, 9232.86ms InterpolantComputationTime, 1152 NumberOfCodeBlocks, 1152 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1274 ConstructedInterpolants, 43 QuantifiedInterpolants, 10678 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 40 InterpolantComputations, 14 PerfectInterpolantSequences, 49/198 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 could not prove your program: unable to determine feasibility of some traces [2021-08-30 18:59:54,108 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-30 18:59:54,139 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... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 18:59:55,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 18:59:55,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 18:59:55,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 18:59:55,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 18:59:55,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 18:59:55,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 18:59:55,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 18:59:55,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 18:59:55,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 18:59:55,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 18:59:55,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 18:59:55,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 18:59:55,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 18:59:55,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 18:59:55,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 18:59:55,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 18:59:55,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 18:59:55,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 18:59:55,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 18:59:55,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 18:59:55,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 18:59:55,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 18:59:55,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 18:59:55,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 18:59:55,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 18:59:55,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 18:59:55,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 18:59:55,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 18:59:55,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 18:59:55,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 18:59:55,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 18:59:55,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 18:59:55,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 18:59:55,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 18:59:55,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 18:59:55,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 18:59:55,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 18:59:55,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 18:59:55,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 18:59:55,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 18:59:55,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-30 18:59:55,546 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 18:59:55,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 18:59:55,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 18:59:55,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 18:59:55,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 18:59:55,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 18:59:55,549 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 18:59:55,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 18:59:55,549 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 18:59:55,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 18:59:55,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 18:59:55,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 18:59:55,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 18:59:55,551 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 18:59:55,551 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 18:59:55,551 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 18:59:55,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 18:59:55,551 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 18:59:55,551 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-30 18:59:55,552 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-30 18:59:55,552 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 18:59:55,552 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 18:59:55,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 18:59:55,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 18:59:55,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 18:59:55,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 18:59:55,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 18:59:55,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 18:59:55,553 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-30 18:59:55,553 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-30 18:59:55,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 18:59:55,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-30 18:59:55,554 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2021-08-30 18:59:55,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 18:59:55,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 18:59:55,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 18:59:55,781 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 18:59:55,781 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 18:59:55,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2021-08-30 18:59:55,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c01f566f/29f706c884af42a4b6708fd954d7cd82/FLAG844ec73db [2021-08-30 18:59:56,225 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 18:59:56,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2021-08-30 18:59:56,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c01f566f/29f706c884af42a4b6708fd954d7cd82/FLAG844ec73db [2021-08-30 18:59:56,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c01f566f/29f706c884af42a4b6708fd954d7cd82 [2021-08-30 18:59:56,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 18:59:56,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 18:59:56,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 18:59:56,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 18:59:56,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 18:59:56,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700ce7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56, skipping insertion in model container [2021-08-30 18:59:56,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 18:59:56,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 18:59:56,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 18:59:56,508 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 18:59:56,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 18:59:56,549 INFO L208 MainTranslator]: Completed translation [2021-08-30 18:59:56,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56 WrapperNode [2021-08-30 18:59:56,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 18:59:56,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 18:59:56,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 18:59:56,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 18:59:56,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 18:59:56,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 18:59:56,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 18:59:56,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 18:59:56,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (1/1) ... [2021-08-30 18:59:56,610 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 18:59:56,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 18:59:56,625 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-30 18:59:56,632 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-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-08-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2021-08-30 18:59:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2021-08-30 18:59:56,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-30 18:59:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-30 18:59:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-30 18:59:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-30 18:59:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-30 18:59:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-30 18:59:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-30 18:59:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-30 18:59:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-30 18:59:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-30 18:59:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-30 18:59:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-30 18:59:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-30 18:59:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-30 18:59:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-30 18:59:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-30 18:59:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-30 18:59:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-30 18:59:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-30 18:59:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-30 18:59:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-30 18:59:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-30 18:59:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-30 18:59:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 18:59:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 18:59:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-30 18:59:56,972 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-08-30 18:59:56,981 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 18:59:56,982 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-30 18:59:56,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:59:56 BoogieIcfgContainer [2021-08-30 18:59:56,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 18:59:56,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 18:59:56,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 18:59:56,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 18:59:56,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 06:59:56" (1/3) ... [2021-08-30 18:59:56,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d101ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:59:56, skipping insertion in model container [2021-08-30 18:59:56,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:59:56" (2/3) ... [2021-08-30 18:59:56,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d101ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:59:56, skipping insertion in model container [2021-08-30 18:59:56,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:59:56" (3/3) ... [2021-08-30 18:59:56,988 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2021-08-30 18:59:56,991 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 18:59:56,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2021-08-30 18:59:57,018 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 18:59:57,022 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-30 18:59:57,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2021-08-30 18:59:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 76 states have (on average 1.894736842105263) internal successors, (144), 136 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 18:59:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 18:59:57,038 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:57,039 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:59:57,039 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting dll_circular_createErr0REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1881586756, now seen corresponding path program 1 times [2021-08-30 18:59:57,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 18:59:57,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102402981] [2021-08-30 18:59:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:57,082 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 18:59:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 18:59:57,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 18:59:57,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-30 18:59:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:57,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-30 18:59:57,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:57,320 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-30 18:59:57,334 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-30 18:59:57,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:57,375 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-30 18:59:57,376 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 18:59:57,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102402981] [2021-08-30 18:59:57,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102402981] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 18:59:57,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:59:57,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-30 18:59:57,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628549490] [2021-08-30 18:59:57,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 18:59:57,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 18:59:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 18:59:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 18:59:57,405 INFO L87 Difference]: Start difference. First operand has 146 states, 76 states have (on average 1.894736842105263) internal successors, (144), 136 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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-30 18:59:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:57,673 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2021-08-30 18:59:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 18:59:57,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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-30 18:59:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:57,681 INFO L225 Difference]: With dead ends: 143 [2021-08-30 18:59:57,682 INFO L226 Difference]: Without dead ends: 136 [2021-08-30 18:59:57,684 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.30ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 18:59:57,686 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 180.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.57ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 233.22ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:57,687 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 19 Invalid, 258 Unknown, 0 Unchecked, 4.57ms Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 233.22ms Time] [2021-08-30 18:59:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-30 18:59:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-08-30 18:59:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 128 states have internal predecessors, (134), 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-30 18:59:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2021-08-30 18:59:57,737 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 10 [2021-08-30 18:59:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:57,737 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2021-08-30 18:59:57,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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-30 18:59:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2021-08-30 18:59:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 18:59:57,738 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:57,738 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:59:57,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-30 18:59:57,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 18:59:57,939 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting dll_circular_createErr1REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:57,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1881586757, now seen corresponding path program 1 times [2021-08-30 18:59:57,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 18:59:57,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941664068] [2021-08-30 18:59:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:57,941 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 18:59:57,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 18:59:57,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 18:59:57,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-30 18:59:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:58,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 18:59:58,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:58,057 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-30 18:59:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 18:59:58,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:58,140 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-30 18:59:58,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 18:59:58,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941664068] [2021-08-30 18:59:58,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941664068] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 18:59:58,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:59:58,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-30 18:59:58,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343584711] [2021-08-30 18:59:58,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 18:59:58,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 18:59:58,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 18:59:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:59:58,145 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 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-30 18:59:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:58,444 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2021-08-30 18:59:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 18:59:58,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 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-30 18:59:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:58,446 INFO L225 Difference]: With dead ends: 133 [2021-08-30 18:59:58,446 INFO L226 Difference]: Without dead ends: 133 [2021-08-30 18:59:58,446 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.29ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 18:59:58,447 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 236.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.89ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 283.24ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:58,447 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 13 Invalid, 246 Unknown, 0 Unchecked, 3.89ms Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 283.24ms Time] [2021-08-30 18:59:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-30 18:59:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-08-30 18:59:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 125 states have internal predecessors, (131), 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-30 18:59:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2021-08-30 18:59:58,452 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 10 [2021-08-30 18:59:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:58,452 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2021-08-30 18:59:58,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 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-30 18:59:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2021-08-30 18:59:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 18:59:58,452 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:58,452 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:59:58,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-30 18:59:58,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 18:59:58,659 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting dll_circular_createErr10REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:58,659 INFO L82 PathProgramCache]: Analyzing trace with hash 30803427, now seen corresponding path program 1 times [2021-08-30 18:59:58,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 18:59:58,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402111968] [2021-08-30 18:59:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:58,660 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 18:59:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 18:59:58,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 18:59:58,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-30 18:59:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:58,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 18:59:58,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:58,774 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-30 18:59:58,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:58,818 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-30 18:59:58,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 18:59:58,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402111968] [2021-08-30 18:59:58,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402111968] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 18:59:58,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:59:58,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-30 18:59:58,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527818100] [2021-08-30 18:59:58,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 18:59:58,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 18:59:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 18:59:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-30 18:59:58,820 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 18:59:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:59,315 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2021-08-30 18:59:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 18:59:59,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-30 18:59:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:59,316 INFO L225 Difference]: With dead ends: 143 [2021-08-30 18:59:59,316 INFO L226 Difference]: Without dead ends: 143 [2021-08-30 18:59:59,316 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 34.57ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-30 18:59:59,317 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 368.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.66ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 467.42ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:59,317 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 38 Invalid, 858 Unknown, 0 Unchecked, 3.66ms Time], IncrementalHoareTripleChecker [4 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 467.42ms Time] [2021-08-30 18:59:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-30 18:59:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2021-08-30 18:59:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 131 states have internal predecessors, (141), 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-30 18:59:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2021-08-30 18:59:59,322 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 15 [2021-08-30 18:59:59,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:59,322 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2021-08-30 18:59:59,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 18:59:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2021-08-30 18:59:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 18:59:59,323 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:59,323 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:59:59,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-30 18:59:59,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 18:59:59,531 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting dll_circular_createErr4REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 18:59:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 18:59:59,532 INFO L82 PathProgramCache]: Analyzing trace with hash 30804964, now seen corresponding path program 1 times [2021-08-30 18:59:59,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 18:59:59,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691451931] [2021-08-30 18:59:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 18:59:59,533 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 18:59:59,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 18:59:59,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 18:59:59,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-30 18:59:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 18:59:59,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-30 18:59:59,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 18:59:59,629 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-30 18:59:59,636 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-30 18:59:59,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 18:59:59,667 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-30 18:59:59,667 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 18:59:59,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691451931] [2021-08-30 18:59:59,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691451931] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 18:59:59,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 18:59:59,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-30 18:59:59,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671995642] [2021-08-30 18:59:59,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 18:59:59,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 18:59:59,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 18:59:59,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 18:59:59,668 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 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-30 18:59:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 18:59:59,821 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2021-08-30 18:59:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 18:59:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 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-30 18:59:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 18:59:59,823 INFO L225 Difference]: With dead ends: 138 [2021-08-30 18:59:59,823 INFO L226 Difference]: Without dead ends: 138 [2021-08-30 18:59:59,823 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 18:59:59,823 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 149.25ms IncrementalHoareTripleChecker+Time [2021-08-30 18:59:59,824 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 13 Invalid, 247 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 149.25ms Time] [2021-08-30 18:59:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-08-30 18:59:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-08-30 18:59:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 79 states have (on average 1.759493670886076) internal successors, (139), 130 states have internal predecessors, (139), 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-30 18:59:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2021-08-30 18:59:59,828 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 15 [2021-08-30 18:59:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 18:59:59,828 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2021-08-30 18:59:59,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 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-30 18:59:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2021-08-30 18:59:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 18:59:59,829 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 18:59:59,829 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 18:59:59,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:00,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:00,029 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting dll_circular_createErr5REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash 30804965, now seen corresponding path program 1 times [2021-08-30 19:00:00,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:00,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41594913] [2021-08-30 19:00:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:00,030 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:00,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:00,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:00,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-30 19:00:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:00,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 19:00:00,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:00,111 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-30 19:00:00,123 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-30 19:00:00,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:00,185 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-30 19:00:00,185 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:00,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41594913] [2021-08-30 19:00:00,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41594913] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:00:00,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:00:00,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-30 19:00:00,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897378043] [2021-08-30 19:00:00,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 19:00:00,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 19:00:00,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 19:00:00,186 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 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-30 19:00:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:00,453 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2021-08-30 19:00:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 19:00:00,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 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-30 19:00:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:00,454 INFO L225 Difference]: With dead ends: 137 [2021-08-30 19:00:00,454 INFO L226 Difference]: Without dead ends: 137 [2021-08-30 19:00:00,455 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.19ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 19:00:00,455 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 218.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.85ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 261.60ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:00,456 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 13 Invalid, 246 Unknown, 0 Unchecked, 0.85ms Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 261.60ms Time] [2021-08-30 19:00:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-30 19:00:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-08-30 19:00:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.7341772151898733) internal successors, (137), 129 states have internal predecessors, (137), 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-30 19:00:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2021-08-30 19:00:00,463 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 15 [2021-08-30 19:00:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:00,463 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2021-08-30 19:00:00,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 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-30 19:00:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2021-08-30 19:00:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 19:00:00,464 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:00,464 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:00:00,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:00,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:00,669 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting dll_circular_createErr6REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash 954954032, now seen corresponding path program 1 times [2021-08-30 19:00:00,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:00,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945746660] [2021-08-30 19:00:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:00,669 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:00,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-30 19:00:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:00,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 19:00:00,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:00,764 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-30 19:00:00,796 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-30 19:00:00,796 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 17 treesize of output 22 [2021-08-30 19:00:00,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-30 19:00:00,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:00,855 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-30 19:00:00,856 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:00,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945746660] [2021-08-30 19:00:00,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945746660] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:00:00,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:00:00,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-30 19:00:00,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562157341] [2021-08-30 19:00:00,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 19:00:00,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:00,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 19:00:00,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 19:00:00,857 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 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-30 19:00:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:01,072 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2021-08-30 19:00:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 19:00:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 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-30 19:00:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:01,073 INFO L225 Difference]: With dead ends: 138 [2021-08-30 19:00:01,073 INFO L226 Difference]: Without dead ends: 138 [2021-08-30 19:00:01,073 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:00:01,073 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 166.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.18ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 203.83ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:01,074 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 369 Unknown, 0 Unchecked, 1.18ms Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 203.83ms Time] [2021-08-30 19:00:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-08-30 19:00:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2021-08-30 19:00:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 129 states have internal predecessors, (136), 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-30 19:00:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2021-08-30 19:00:01,077 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 16 [2021-08-30 19:00:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:01,078 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2021-08-30 19:00:01,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 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-30 19:00:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2021-08-30 19:00:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 19:00:01,078 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:01,078 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:00:01,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:01,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:01,287 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting dll_circular_createErr7REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash 954954033, now seen corresponding path program 1 times [2021-08-30 19:00:01,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:01,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417816440] [2021-08-30 19:00:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:01,288 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:01,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:01,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:01,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-30 19:00:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:01,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 19:00:01,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:01,384 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-30 19:00:01,389 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-30 19:00:01,471 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 19:00:01,472 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 27 treesize of output 29 [2021-08-30 19:00:01,482 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 19:00:01,482 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 26 treesize of output 26 [2021-08-30 19:00:01,557 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-30 19:00:01,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:04,462 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-30 19:00:04,462 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:04,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417816440] [2021-08-30 19:00:04,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417816440] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:00:04,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:00:04,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-30 19:00:04,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336216972] [2021-08-30 19:00:04,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 19:00:04,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 19:00:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-08-30 19:00:04,464 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (3), 1 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-30 19:00:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:05,133 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-08-30 19:00:05,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 19:00:05,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (3), 1 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-30 19:00:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:05,134 INFO L225 Difference]: With dead ends: 137 [2021-08-30 19:00:05,134 INFO L226 Difference]: Without dead ends: 137 [2021-08-30 19:00:05,134 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2685.82ms TimeCoverageRelationStatistics Valid=34, Invalid=55, Unknown=1, NotChecked=0, Total=90 [2021-08-30 19:00:05,134 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 535.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.50ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 620.06ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:05,135 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 879 Unknown, 0 Unchecked, 3.50ms Time], IncrementalHoareTripleChecker [4 Valid, 497 Invalid, 0 Unknown, 378 Unchecked, 620.06ms Time] [2021-08-30 19:00:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-30 19:00:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-08-30 19:00:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 129 states have internal predecessors, (135), 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-30 19:00:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2021-08-30 19:00:05,141 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 16 [2021-08-30 19:00:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:05,142 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2021-08-30 19:00:05,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (3), 1 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-30 19:00:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2021-08-30 19:00:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-30 19:00:05,142 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:05,142 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:00:05,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-08-30 19:00:05,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:05,349 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting dll_circular_createErr6REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash -804512848, now seen corresponding path program 1 times [2021-08-30 19:00:05,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:05,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419352869] [2021-08-30 19:00:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:05,350 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:05,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:05,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:05,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-30 19:00:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:05,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 19:00:05,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:05,456 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-30 19:00:05,497 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-30 19:00:05,497 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 21 [2021-08-30 19:00:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:00:05,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:00:05,587 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:05,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419352869] [2021-08-30 19:00:05,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419352869] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:00:05,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:00:05,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-08-30 19:00:05,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238157470] [2021-08-30 19:00:05,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 19:00:05,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 19:00:05,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 19:00:05,588 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 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-30 19:00:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:05,865 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2021-08-30 19:00:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 19:00:05,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 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 21 [2021-08-30 19:00:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:05,867 INFO L225 Difference]: With dead ends: 135 [2021-08-30 19:00:05,867 INFO L226 Difference]: Without dead ends: 135 [2021-08-30 19:00:05,867 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.34ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:00:05,867 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 224.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 264.61ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:05,867 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 19 Invalid, 369 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 264.61ms Time] [2021-08-30 19:00:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-30 19:00:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-08-30 19:00:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 79 states have (on average 1.6835443037974684) internal successors, (133), 127 states have internal predecessors, (133), 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-30 19:00:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2021-08-30 19:00:05,871 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 21 [2021-08-30 19:00:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:05,871 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2021-08-30 19:00:05,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 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-30 19:00:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2021-08-30 19:00:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-30 19:00:05,872 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:05,872 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:00:05,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:06,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:06,077 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting dll_circular_createErr7REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:06,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash -804512847, now seen corresponding path program 1 times [2021-08-30 19:00:06,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:06,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647857451] [2021-08-30 19:00:06,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:06,078 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:06,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:06,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:06,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-30 19:00:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:06,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 19:00:06,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:06,197 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-30 19:00:06,204 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-30 19:00:06,290 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 19:00:06,290 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 27 treesize of output 29 [2021-08-30 19:00:06,300 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 19:00:06,300 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 26 treesize of output 26 [2021-08-30 19:00:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:00:06,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:00:08,826 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:08,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647857451] [2021-08-30 19:00:08,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647857451] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:00:08,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:00:08,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-30 19:00:08,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066121402] [2021-08-30 19:00:08,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 19:00:08,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 19:00:08,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-08-30 19:00:08,827 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 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-30 19:00:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:09,316 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2021-08-30 19:00:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 19:00:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 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 21 [2021-08-30 19:00:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:09,317 INFO L225 Difference]: With dead ends: 133 [2021-08-30 19:00:09,317 INFO L226 Difference]: Without dead ends: 133 [2021-08-30 19:00:09,317 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2323.15ms TimeCoverageRelationStatistics Valid=32, Invalid=57, Unknown=1, NotChecked=0, Total=90 [2021-08-30 19:00:09,318 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 361.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.88ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 417.97ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:09,318 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 503 Unknown, 0 Unchecked, 1.88ms Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 253 Unchecked, 417.97ms Time] [2021-08-30 19:00:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-30 19:00:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-08-30 19:00:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 125 states have internal predecessors, (131), 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-30 19:00:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2021-08-30 19:00:09,321 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 21 [2021-08-30 19:00:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:09,321 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2021-08-30 19:00:09,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 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-30 19:00:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2021-08-30 19:00:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-30 19:00:09,322 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:09,322 INFO L513 BasicCegarLoop]: trace histogram [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-30 19:00:09,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:09,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:09,529 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:09,529 INFO L82 PathProgramCache]: Analyzing trace with hash -486193078, now seen corresponding path program 1 times [2021-08-30 19:00:09,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:09,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512268844] [2021-08-30 19:00:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:09,530 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:09,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:09,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:09,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-30 19:00:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:09,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 19:00:09,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:09,648 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-30 19:00:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:00:09,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:00:09,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:09,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512268844] [2021-08-30 19:00:09,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512268844] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:00:09,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:00:09,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-08-30 19:00:09,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22887605] [2021-08-30 19:00:09,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-30 19:00:09,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-30 19:00:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-30 19:00:09,891 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 19:00:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:10,648 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-08-30 19:00:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 19:00:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-08-30 19:00:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:10,650 INFO L225 Difference]: With dead ends: 130 [2021-08-30 19:00:10,650 INFO L226 Difference]: Without dead ends: 130 [2021-08-30 19:00:10,650 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 112.22ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-30 19:00:10,650 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 58 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 612.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.57ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 712.37ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:10,651 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 41 Invalid, 948 Unknown, 0 Unchecked, 3.57ms Time], IncrementalHoareTripleChecker [5 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 712.37ms Time] [2021-08-30 19:00:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-08-30 19:00:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-08-30 19:00:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.620253164556962) internal successors, (128), 122 states have internal predecessors, (128), 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-30 19:00:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2021-08-30 19:00:10,653 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 32 [2021-08-30 19:00:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:10,653 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2021-08-30 19:00:10,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 19:00:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2021-08-30 19:00:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-30 19:00:10,654 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:10,654 INFO L513 BasicCegarLoop]: trace histogram [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-30 19:00:10,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:10,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:10,861 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash -486193077, now seen corresponding path program 1 times [2021-08-30 19:00:10,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:10,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969783311] [2021-08-30 19:00:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:10,862 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:10,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:10,863 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:10,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-30 19:00:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:10,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-30 19:00:10,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:10,998 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-30 19:00:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:00:11,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:00:11,883 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:11,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969783311] [2021-08-30 19:00:11,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969783311] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:00:11,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:00:11,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2021-08-30 19:00:11,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628207702] [2021-08-30 19:00:11,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 19:00:11,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:11,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 19:00:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-08-30 19:00:11,885 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:00:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:14,404 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-08-30 19:00:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-30 19:00:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2021-08-30 19:00:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:14,405 INFO L225 Difference]: With dead ends: 123 [2021-08-30 19:00:14,405 INFO L226 Difference]: Without dead ends: 123 [2021-08-30 19:00:14,405 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 621.86ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-08-30 19:00:14,406 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 294 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2081.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.46ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2348.31ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:14,406 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 54 Invalid, 1272 Unknown, 0 Unchecked, 8.46ms Time], IncrementalHoareTripleChecker [10 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 2348.31ms Time] [2021-08-30 19:00:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-30 19:00:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-08-30 19:00:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 115 states have internal predecessors, (121), 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-30 19:00:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2021-08-30 19:00:14,408 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 32 [2021-08-30 19:00:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:14,409 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2021-08-30 19:00:14,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:00:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2021-08-30 19:00:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 19:00:14,410 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:14,410 INFO L513 BasicCegarLoop]: trace histogram [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-30 19:00:14,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:14,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:14,617 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash -813773906, now seen corresponding path program 1 times [2021-08-30 19:00:14,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:14,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271418855] [2021-08-30 19:00:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:14,618 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:14,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:14,619 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:14,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-30 19:00:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:14,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 19:00:14,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:00:15,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:00:15,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:15,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271418855] [2021-08-30 19:00:15,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271418855] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:00:15,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:00:15,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2021-08-30 19:00:15,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122642471] [2021-08-30 19:00:15,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 19:00:15,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 19:00:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:00:15,549 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:00:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:15,786 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2021-08-30 19:00:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 19:00:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2021-08-30 19:00:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:15,787 INFO L225 Difference]: With dead ends: 122 [2021-08-30 19:00:15,787 INFO L226 Difference]: Without dead ends: 122 [2021-08-30 19:00:15,788 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 262.71ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:00:15,788 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 190.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.34ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 228.14ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:15,788 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 868 Unknown, 0 Unchecked, 1.34ms Time], IncrementalHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 595 Unchecked, 228.14ms Time] [2021-08-30 19:00:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-08-30 19:00:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-08-30 19:00:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.518987341772152) internal successors, (120), 114 states have internal predecessors, (120), 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-30 19:00:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2021-08-30 19:00:15,790 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 38 [2021-08-30 19:00:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:15,790 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2021-08-30 19:00:15,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:00:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2021-08-30 19:00:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 19:00:15,791 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:15,791 INFO L513 BasicCegarLoop]: trace histogram [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-30 19:00:15,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:15,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:15,992 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash -813734924, now seen corresponding path program 1 times [2021-08-30 19:00:15,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:15,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181016492] [2021-08-30 19:00:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:15,993 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:15,993 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:15,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-30 19:00:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:16,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-30 19:00:16,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:16,189 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-30 19:00:16,320 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 7 [2021-08-30 19:00:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:00:16,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 19:00:16,706 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:16,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181016492] [2021-08-30 19:00:16,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181016492] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:00:16,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:00:16,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 18 [2021-08-30 19:00:16,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706479484] [2021-08-30 19:00:16,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-30 19:00:16,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-30 19:00:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-30 19:00:16,708 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 19 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:00:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:00:17,939 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2021-08-30 19:00:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-30 19:00:17,939 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-08-30 19:00:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:00:17,940 INFO L225 Difference]: With dead ends: 117 [2021-08-30 19:00:17,940 INFO L226 Difference]: Without dead ends: 117 [2021-08-30 19:00:17,940 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 411.78ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-08-30 19:00:17,941 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 273 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 928.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.22ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1077.82ms IncrementalHoareTripleChecker+Time [2021-08-30 19:00:17,941 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 68 Invalid, 1235 Unknown, 0 Unchecked, 4.22ms Time], IncrementalHoareTripleChecker [10 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1077.82ms Time] [2021-08-30 19:00:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-30 19:00:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-08-30 19:00:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 109 states have internal predecessors, (115), 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-30 19:00:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2021-08-30 19:00:17,943 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 38 [2021-08-30 19:00:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:00:17,944 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2021-08-30 19:00:17,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:00:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2021-08-30 19:00:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 19:00:17,944 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:00:17,945 INFO L513 BasicCegarLoop]: trace histogram [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-30 19:00:17,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-30 19:00:18,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:00:18,149 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:00:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:00:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash -813736140, now seen corresponding path program 1 times [2021-08-30 19:00:18,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:00:18,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307258421] [2021-08-30 19:00:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:00:18,150 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:00:18,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:00:18,151 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:00:18,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-30 19:00:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:00:18,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-30 19:00:18,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:00:18,312 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-30 19:00:18,399 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 19:00:18,399 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 26 treesize of output 28 [2021-08-30 19:00:18,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 19:00:18,489 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-30 19:00:18,490 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2021-08-30 19:00:18,610 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-30 19:00:18,611 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 3 case distinctions, treesize of input 45 treesize of output 42 [2021-08-30 19:00:18,707 INFO L354 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2021-08-30 19:00:18,707 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 6 case distinctions, treesize of input 54 treesize of output 54 [2021-08-30 19:00:19,442 INFO L354 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2021-08-30 19:00:19,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 32 [2021-08-30 19:00:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:00:19,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:00:51,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.offset| c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) c_dll_circular_create_~head~0.offset) c_dll_circular_create_~new_head~0.offset)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.offset))) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) (_ bv0 32))) is different from false [2021-08-30 19:00:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2021-08-30 19:00:54,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:00:54,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307258421] [2021-08-30 19:00:54,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307258421] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:00:54,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:00:54,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-08-30 19:00:54,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914436377] [2021-08-30 19:00:54,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-30 19:00:54,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:00:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-30 19:00:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=822, Unknown=16, NotChecked=58, Total=992 [2021-08-30 19:00:54,559 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 32 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:01:07,862 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.offset| c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) c_dll_circular_create_~head~0.offset) c_dll_circular_create_~new_head~0.offset)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.offset))) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) (_ bv0 32))) (or (not (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_dll_circular_create_~head~0.base))) (_ bv1 1)))) (forall ((v_dll_circular_create_~new_head~0.base_44 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_dll_circular_create_~new_head~0.base_44)))) (and (= (bvadd c_dll_circular_create_~new_head~0.offset (_ bv4 32)) (_ bv0 32)) (= c_dll_circular_create_~new_head~0.base v_dll_circular_create_~new_head~0.base_44)))) (= c_dll_circular_create_~new_head~0.offset (_ bv0 32)))) is different from false [2021-08-30 19:01:43,096 WARN L210 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 30 [2021-08-30 19:02:28,367 WARN L210 SmtUtils]: Spent 13.57s on a formula simplification that was a NOOP. DAG size: 30 [2021-08-30 19:02:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:02:28,789 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2021-08-30 19:02:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-30 19:02:28,790 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-08-30 19:02:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:02:28,791 INFO L225 Difference]: With dead ends: 130 [2021-08-30 19:02:28,791 INFO L226 Difference]: Without dead ends: 130 [2021-08-30 19:02:28,791 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 128413.18ms TimeCoverageRelationStatistics Valid=160, Invalid=1212, Unknown=42, NotChecked=146, Total=1560 [2021-08-30 19:02:28,792 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 90 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 472.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.60ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 752 IncrementalHoareTripleChecker+Unchecked, 540.09ms IncrementalHoareTripleChecker+Time [2021-08-30 19:02:28,792 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 112 Invalid, 1475 Unknown, 0 Unchecked, 5.60ms Time], IncrementalHoareTripleChecker [6 Valid, 717 Invalid, 0 Unknown, 752 Unchecked, 540.09ms Time] [2021-08-30 19:02:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-08-30 19:02:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2021-08-30 19:02:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 105 states have internal predecessors, (111), 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-30 19:02:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2021-08-30 19:02:28,796 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 38 [2021-08-30 19:02:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:02:28,796 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2021-08-30 19:02:28,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:02:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2021-08-30 19:02:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-30 19:02:28,797 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:02:28,797 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:02:28,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-30 19:02:29,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:02:29,005 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:02:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:02:29,006 INFO L82 PathProgramCache]: Analyzing trace with hash 544021278, now seen corresponding path program 1 times [2021-08-30 19:02:29,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:02:29,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183382848] [2021-08-30 19:02:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:02:29,006 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:02:29,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:02:29,007 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:02:29,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-30 19:02:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:02:29,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-30 19:02:29,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:02:29,291 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 21 treesize of output 17 [2021-08-30 19:02:29,508 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 11 [2021-08-30 19:02:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:02:29,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:02:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 19:02:30,172 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:02:30,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183382848] [2021-08-30 19:02:30,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183382848] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:02:30,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:02:30,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 22 [2021-08-30 19:02:30,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321538139] [2021-08-30 19:02:30,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-30 19:02:30,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:02:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-30 19:02:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-08-30 19:02:30,174 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand has 23 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:02:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:02:32,452 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2021-08-30 19:02:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-30 19:02:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2021-08-30 19:02:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:02:32,454 INFO L225 Difference]: With dead ends: 108 [2021-08-30 19:02:32,454 INFO L226 Difference]: Without dead ends: 108 [2021-08-30 19:02:32,454 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 853.92ms TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2021-08-30 19:02:32,455 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 492 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1691.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.17ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1952.71ms IncrementalHoareTripleChecker+Time [2021-08-30 19:02:32,455 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 9 Invalid, 1411 Unknown, 0 Unchecked, 9.17ms Time], IncrementalHoareTripleChecker [13 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1952.71ms Time] [2021-08-30 19:02:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-30 19:02:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-08-30 19:02:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.3417721518987342) 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-30 19:02:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2021-08-30 19:02:32,457 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 39 [2021-08-30 19:02:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:02:32,457 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2021-08-30 19:02:32,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:02:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2021-08-30 19:02:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-30 19:02:32,458 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:02:32,458 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:02:32,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-30 19:02:32,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:02:32,671 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:02:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:02:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash 543983544, now seen corresponding path program 1 times [2021-08-30 19:02:32,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:02:32,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646695261] [2021-08-30 19:02:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:02:32,672 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:02:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:02:32,673 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:02:32,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-30 19:02:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:02:32,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-30 19:02:32,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:02:32,817 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-30 19:02:32,931 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 19:02:32,931 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 28 treesize of output 30 [2021-08-30 19:02:32,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 19:02:33,056 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 19:02:33,057 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-30 19:02:33,247 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 19:02:33,247 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 2 case distinctions, treesize of input 40 treesize of output 37 [2021-08-30 19:02:33,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 19:02:33,381 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 19:02:33,382 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 5 case distinctions, treesize of input 53 treesize of output 53 [2021-08-30 19:02:34,223 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 19:02:34,223 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 58 treesize of output 30 [2021-08-30 19:02:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:02:34,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:02:36,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) c_dll_circular_create_~head~0.offset) |c_#StackHeapBarrier|)) is different from false [2021-08-30 19:02:38,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) |c_#StackHeapBarrier|)) is different from false [2021-08-30 19:02:40,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (dll_circular_create_~head~0.offset (_ BitVec 32))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) dll_circular_create_~head~0.offset) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) |c_#StackHeapBarrier|)) is different from false [2021-08-30 19:02:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-08-30 19:02:40,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:02:40,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646695261] [2021-08-30 19:02:40,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646695261] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:02:40,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:02:40,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2021-08-30 19:02:40,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635876697] [2021-08-30 19:02:40,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-30 19:02:40,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:02:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-30 19:02:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=841, Unknown=3, NotChecked=180, Total=1122 [2021-08-30 19:02:40,560 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 34 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:02:48,981 WARN L210 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-08-30 19:02:54,335 WARN L210 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2021-08-30 19:02:56,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (dll_circular_create_~head~0.offset (_ BitVec 32))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) dll_circular_create_~head~0.offset) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) |c_#StackHeapBarrier|)) (or (not (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_dll_circular_create_~head~0.base))) (_ bv1 1)))) (forall ((v_dll_circular_create_~new_head~0.base_58 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_dll_circular_create_~new_head~0.base_58))) (not (bvult v_dll_circular_create_~new_head~0.base_58 |c_#StackHeapBarrier|)))) (bvult c_dll_circular_create_~new_head~0.base |c_#StackHeapBarrier|))) is different from false [2021-08-30 19:02:58,135 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) |c_#StackHeapBarrier|)) (or (forall ((v_dll_circular_create_~new_head~0.base_58 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_dll_circular_create_~new_head~0.base_58))) (not (bvult v_dll_circular_create_~new_head~0.base_58 |c_#StackHeapBarrier|)))) (bvult c_dll_circular_create_~new_head~0.base |c_#StackHeapBarrier|))) is different from false [2021-08-30 19:02:59,751 WARN L838 $PredicateComparison]: unable to prove that (and (or (bvult c_dll_circular_create_~head~0.base |c_#StackHeapBarrier|) (forall ((v_dll_circular_create_~new_head~0.base_58 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_dll_circular_create_~new_head~0.base_58))) (not (bvult v_dll_circular_create_~new_head~0.base_58 |c_#StackHeapBarrier|))))) (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) c_dll_circular_create_~head~0.offset) |c_#StackHeapBarrier|))) is different from false [2021-08-30 19:03:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:03:00,128 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2021-08-30 19:03:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-30 19:03:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-08-30 19:03:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:03:00,130 INFO L225 Difference]: With dead ends: 131 [2021-08-30 19:03:00,130 INFO L226 Difference]: Without dead ends: 131 [2021-08-30 19:03:00,131 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 25394.48ms TimeCoverageRelationStatistics Valid=146, Invalid=1132, Unknown=6, NotChecked=438, Total=1722 [2021-08-30 19:03:00,131 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 429.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.80ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 989 IncrementalHoareTripleChecker+Unchecked, 494.15ms IncrementalHoareTripleChecker+Time [2021-08-30 19:03:00,131 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 100 Invalid, 1431 Unknown, 0 Unchecked, 3.80ms Time], IncrementalHoareTripleChecker [5 Valid, 437 Invalid, 0 Unknown, 989 Unchecked, 494.15ms Time] [2021-08-30 19:03:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-30 19:03:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2021-08-30 19:03:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.3291139240506329) 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-30 19:03:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-08-30 19:03:00,134 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 39 [2021-08-30 19:03:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:03:00,134 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-08-30 19:03:00,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:03:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-08-30 19:03:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 19:03:00,134 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:03:00,134 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:03:00,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-08-30 19:03:00,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:03:00,335 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:03:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:03:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -315209418, now seen corresponding path program 1 times [2021-08-30 19:03:00,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:03:00,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873778810] [2021-08-30 19:03:00,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:03:00,336 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:03:00,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:03:00,337 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:03:00,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-30 19:03:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:03:00,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-30 19:03:00,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:03:00,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 22 treesize of output 18 [2021-08-30 19:03:00,639 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 29 treesize of output 21 [2021-08-30 19:03:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:03:00,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:03:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 19:03:01,091 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:03:01,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873778810] [2021-08-30 19:03:01,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873778810] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:03:01,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:03:01,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 19 [2021-08-30 19:03:01,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393602659] [2021-08-30 19:03:01,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-30 19:03:01,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:03:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-30 19:03:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-08-30 19:03:01,092 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 20 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:03:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:03:02,797 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2021-08-30 19:03:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-30 19:03:02,797 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-08-30 19:03:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:03:02,798 INFO L225 Difference]: With dead ends: 106 [2021-08-30 19:03:02,798 INFO L226 Difference]: Without dead ends: 106 [2021-08-30 19:03:02,798 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 554.84ms TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2021-08-30 19:03:02,798 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1299.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.91ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1482.10ms IncrementalHoareTripleChecker+Time [2021-08-30 19:03:02,799 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 72 Invalid, 1473 Unknown, 0 Unchecked, 6.91ms Time], IncrementalHoareTripleChecker [7 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1482.10ms Time] [2021-08-30 19:03:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-08-30 19:03:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-08-30 19:03:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 98 states have internal predecessors, (104), 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-30 19:03:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2021-08-30 19:03:02,801 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 40 [2021-08-30 19:03:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:03:02,801 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2021-08-30 19:03:02,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:03:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2021-08-30 19:03:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-30 19:03:02,802 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:03:02,802 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:03:02,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-30 19:03:03,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:03:03,009 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:03:03,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:03:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash -316379210, now seen corresponding path program 1 times [2021-08-30 19:03:03,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:03:03,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706810693] [2021-08-30 19:03:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:03:03,010 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:03:03,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:03:03,012 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:03:03,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-30 19:03:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:03:03,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-30 19:03:03,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:03:03,152 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-30 19:03:03,222 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 19:03:03,223 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 23 treesize of output 25 [2021-08-30 19:03:03,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 19:03:03,310 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 19:03:03,311 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2021-08-30 19:03:03,464 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 19:03:03,464 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 2 case distinctions, treesize of input 46 treesize of output 43 [2021-08-30 19:03:03,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 19:03:03,571 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 19:03:03,571 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 5 case distinctions, treesize of input 59 treesize of output 59 [2021-08-30 19:03:04,144 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 19:03:04,147 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 67 treesize of output 39 [2021-08-30 19:03:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:03:04,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:03:06,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) c_dll_circular_create_~head~0.offset))))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-30 19:03:07,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset)))))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-30 19:03:07,480 INFO L354 Elim1Store]: treesize reduction 5, result has 87.5 percent of original size [2021-08-30 19:03:07,481 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 70 treesize of output 69 [2021-08-30 19:03:09,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) dll_circular_create_~head~0.offset) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) c_dll_circular_create_~head~0.base)) is different from false [2021-08-30 19:03:09,771 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:03:09,772 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 31 treesize of output 30 [2021-08-30 19:03:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-08-30 19:03:09,796 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:03:09,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706810693] [2021-08-30 19:03:09,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706810693] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:03:09,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:03:09,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2021-08-30 19:03:09,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414063315] [2021-08-30 19:03:09,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-30 19:03:09,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:03:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-30 19:03:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=732, Unknown=3, NotChecked=168, Total=992 [2021-08-30 19:03:09,798 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:03:12,000 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) dll_circular_create_~head~0.offset) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) c_dll_circular_create_~head~0.base)) (= c_dll_circular_create_~last~0.base c_dll_circular_create_~head~0.base) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| c_dll_circular_create_~new_head~0.base)))) is different from false [2021-08-30 19:03:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:03:21,124 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2021-08-30 19:03:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-30 19:03:21,125 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-08-30 19:03:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:03:21,125 INFO L225 Difference]: With dead ends: 134 [2021-08-30 19:03:21,125 INFO L226 Difference]: Without dead ends: 134 [2021-08-30 19:03:21,126 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 16003.83ms TimeCoverageRelationStatistics Valid=133, Invalid=1069, Unknown=4, NotChecked=276, Total=1482 [2021-08-30 19:03:21,126 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 713.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.89ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 875 IncrementalHoareTripleChecker+Unchecked, 818.26ms IncrementalHoareTripleChecker+Time [2021-08-30 19:03:21,126 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 148 Invalid, 2026 Unknown, 0 Unchecked, 3.89ms Time], IncrementalHoareTripleChecker [8 Valid, 1143 Invalid, 0 Unknown, 875 Unchecked, 818.26ms Time] [2021-08-30 19:03:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-30 19:03:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2021-08-30 19:03:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 118 states have internal predecessors, (127), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-30 19:03:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-08-30 19:03:21,129 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 40 [2021-08-30 19:03:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:03:21,129 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-08-30 19:03:21,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:03:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-08-30 19:03:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-30 19:03:21,130 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:03:21,130 INFO L513 BasicCegarLoop]: trace histogram [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-30 19:03:21,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-30 19:03:21,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:03:21,338 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:03:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:03:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash 383105491, now seen corresponding path program 1 times [2021-08-30 19:03:21,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:03:21,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368780125] [2021-08-30 19:03:21,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:03:21,339 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:03:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:03:21,340 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:03:21,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-30 19:03:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:03:21,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-30 19:03:21,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:03:21,504 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-30 19:03:21,605 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-30 19:03:21,605 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 24 treesize of output 26 [2021-08-30 19:03:21,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 19:03:21,731 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 19:03:21,731 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-30 19:03:21,922 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 19:03:21,922 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 2 case distinctions, treesize of input 40 treesize of output 37 [2021-08-30 19:03:22,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 19:03:22,048 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 19:03:22,049 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 5 case distinctions, treesize of input 53 treesize of output 53 [2021-08-30 19:03:24,898 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 19:03:24,898 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 58 treesize of output 30 [2021-08-30 19:03:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:03:25,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:03:27,540 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) c_dll_circular_create_~head~0.offset) |c_#StackHeapBarrier|)) is different from false [2021-08-30 19:03:28,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) |c_#StackHeapBarrier|)) is different from false [2021-08-30 19:04:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-08-30 19:04:07,298 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:04:07,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368780125] [2021-08-30 19:04:07,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368780125] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:04:07,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:04:07,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2021-08-30 19:04:07,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666443929] [2021-08-30 19:04:07,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-30 19:04:07,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:04:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-30 19:04:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=880, Unknown=20, NotChecked=122, Total=1122 [2021-08-30 19:04:07,300 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 34 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:04:16,122 WARN L210 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-08-30 19:04:38,252 WARN L210 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 46 [2021-08-30 19:04:39,848 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset) |c_#StackHeapBarrier|)) (or (forall ((v_dll_circular_create_~new_head~0.base_76 (_ BitVec 32))) (or (not (bvult v_dll_circular_create_~new_head~0.base_76 |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_dll_circular_create_~new_head~0.base_76))))))) (bvult c_dll_circular_create_~new_head~0.base |c_#StackHeapBarrier|))) is different from false [2021-08-30 19:04:41,502 WARN L838 $PredicateComparison]: unable to prove that (and (or (bvult c_dll_circular_create_~head~0.base |c_#StackHeapBarrier|) (forall ((v_dll_circular_create_~new_head~0.base_76 (_ BitVec 32))) (or (not (bvult v_dll_circular_create_~new_head~0.base_76 |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_dll_circular_create_~new_head~0.base_76)))))))) (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (bvult (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) c_dll_circular_create_~head~0.offset) |c_#StackHeapBarrier|))) is different from false [2021-08-30 19:04:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:04:42,146 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2021-08-30 19:04:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-30 19:04:42,146 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-08-30 19:04:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:04:42,147 INFO L225 Difference]: With dead ends: 152 [2021-08-30 19:04:42,147 INFO L226 Difference]: Without dead ends: 152 [2021-08-30 19:04:42,148 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 78327.42ms TimeCoverageRelationStatistics Valid=201, Invalid=1512, Unknown=25, NotChecked=332, Total=2070 [2021-08-30 19:04:42,148 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 763.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.08ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 749 IncrementalHoareTripleChecker+Unchecked, 887.59ms IncrementalHoareTripleChecker+Time [2021-08-30 19:04:42,148 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 1671 Unknown, 0 Unchecked, 3.08ms Time], IncrementalHoareTripleChecker [7 Valid, 915 Invalid, 0 Unknown, 749 Unchecked, 887.59ms Time] [2021-08-30 19:04:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-30 19:04:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2021-08-30 19:04:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 117 states have internal predecessors, (126), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-30 19:04:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2021-08-30 19:04:42,151 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 42 [2021-08-30 19:04:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:04:42,152 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2021-08-30 19:04:42,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:04:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2021-08-30 19:04:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-30 19:04:42,152 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:04:42,152 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:04:42,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-30 19:04:42,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:04:42,360 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:04:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:04:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1008200613, now seen corresponding path program 1 times [2021-08-30 19:04:42,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:04:42,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763246754] [2021-08-30 19:04:42,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:04:42,361 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:04:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:04:42,362 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:04:42,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-30 19:04:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:04:42,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-30 19:04:42,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:04:42,527 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-30 19:04:42,528 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 20 treesize of output 27 [2021-08-30 19:04:42,636 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 27 treesize of output 23 [2021-08-30 19:04:42,851 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 31 treesize of output 19 [2021-08-30 19:04:42,974 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-30 19:04:42,974 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 44 treesize of output 47 [2021-08-30 19:04:43,059 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-30 19:04:43,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:04:45,689 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:04:45,690 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 19 treesize of output 18 [2021-08-30 19:04:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:04:45,712 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:04:45,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763246754] [2021-08-30 19:04:45,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763246754] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:04:45,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:04:45,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2021-08-30 19:04:45,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071787285] [2021-08-30 19:04:45,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-30 19:04:45,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:04:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-30 19:04:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=632, Unknown=1, NotChecked=0, Total=702 [2021-08-30 19:04:45,713 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 27 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:04:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:04:51,875 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2021-08-30 19:04:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-30 19:04:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2021-08-30 19:04:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:04:51,877 INFO L225 Difference]: With dead ends: 126 [2021-08-30 19:04:51,877 INFO L226 Difference]: Without dead ends: 126 [2021-08-30 19:04:51,877 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 7127.57ms TimeCoverageRelationStatistics Valid=153, Invalid=1178, Unknown=1, NotChecked=0, Total=1332 [2021-08-30 19:04:51,878 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 98 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1439.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.53ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 1654.53ms IncrementalHoareTripleChecker+Time [2021-08-30 19:04:51,878 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 84 Invalid, 1660 Unknown, 0 Unchecked, 4.53ms Time], IncrementalHoareTripleChecker [16 Valid, 1625 Invalid, 0 Unknown, 19 Unchecked, 1654.53ms Time] [2021-08-30 19:04:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-08-30 19:04:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-08-30 19:04:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 116 states have internal predecessors, (125), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-30 19:04:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2021-08-30 19:04:51,881 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 43 [2021-08-30 19:04:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:04:51,881 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2021-08-30 19:04:51,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:04:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2021-08-30 19:04:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-30 19:04:51,882 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:04:51,882 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:04:51,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-08-30 19:04:52,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:04:52,089 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:04:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:04:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1008631589, now seen corresponding path program 1 times [2021-08-30 19:04:52,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:04:52,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5399067] [2021-08-30 19:04:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:04:52,090 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:04:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:04:52,091 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:04:52,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-30 19:04:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:04:52,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-30 19:04:52,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:04:52,233 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-30 19:04:52,308 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-08-30 19:04:52,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 46 [2021-08-30 19:04:52,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 19:04:52,475 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 19:04:52,475 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 48 [2021-08-30 19:04:54,361 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 19:04:54,362 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 2 case distinctions, treesize of input 45 treesize of output 42 [2021-08-30 19:04:54,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 19:04:54,480 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 19:04:54,480 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 5 case distinctions, treesize of input 68 treesize of output 68 [2021-08-30 19:04:57,232 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 19:04:57,232 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 5 case distinctions, treesize of input 82 treesize of output 50 [2021-08-30 19:04:57,409 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-30 19:04:57,410 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 41 treesize of output 44 [2021-08-30 19:04:57,522 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-30 19:04:57,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:02,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| c_dll_circular_create_~head~0.base (_ bv0 1)) (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) c_dll_circular_create_~head~0.offset)))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-30 19:05:04,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| c_dll_circular_create_~new_head~0.base (_ bv0 1)) (select (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) c_dll_circular_create_~new_head~0.offset))))))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-30 19:05:08,893 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:05:08,893 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 37 treesize of output 36 [2021-08-30 19:05:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-08-30 19:05:08,917 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:05:08,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5399067] [2021-08-30 19:05:08,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5399067] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:05:08,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:05:08,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2021-08-30 19:05:08,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633789163] [2021-08-30 19:05:08,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-30 19:05:08,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:05:08,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-30 19:05:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=900, Unknown=4, NotChecked=122, Total=1122 [2021-08-30 19:05:08,919 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 34 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:05:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:05:18,249 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2021-08-30 19:05:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-30 19:05:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2021-08-30 19:05:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:05:18,250 INFO L225 Difference]: With dead ends: 124 [2021-08-30 19:05:18,250 INFO L226 Difference]: Without dead ends: 124 [2021-08-30 19:05:18,250 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 21681.64ms TimeCoverageRelationStatistics Valid=123, Invalid=1140, Unknown=5, NotChecked=138, Total=1406 [2021-08-30 19:05:18,251 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 890.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.57ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 470 IncrementalHoareTripleChecker+Unchecked, 1013.09ms IncrementalHoareTripleChecker+Time [2021-08-30 19:05:18,251 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 1711 Unknown, 0 Unchecked, 3.57ms Time], IncrementalHoareTripleChecker [6 Valid, 1235 Invalid, 0 Unknown, 470 Unchecked, 1013.09ms Time] [2021-08-30 19:05:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-30 19:05:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2021-08-30 19:05:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 94 states have internal predecessors, (100), 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-30 19:05:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2021-08-30 19:05:18,254 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 43 [2021-08-30 19:05:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:05:18,254 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2021-08-30 19:05:18,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:05:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2021-08-30 19:05:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-30 19:05:18,254 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:05:18,254 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:05:18,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-30 19:05:18,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:05:18,459 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:05:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:05:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1605098671, now seen corresponding path program 1 times [2021-08-30 19:05:18,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:05:18,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703884520] [2021-08-30 19:05:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:05:18,459 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:05:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:05:18,469 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:05:18,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-30 19:05:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:05:18,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 19:05:18,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:05:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:05:19,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:05:19,346 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:05:19,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703884520] [2021-08-30 19:05:19,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703884520] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:05:19,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:05:19,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2021-08-30 19:05:19,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71030402] [2021-08-30 19:05:19,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 19:05:19,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:05:19,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 19:05:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:05:19,348 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:05:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:05:19,700 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2021-08-30 19:05:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-30 19:05:19,702 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-08-30 19:05:19,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:05:19,702 INFO L225 Difference]: With dead ends: 103 [2021-08-30 19:05:19,702 INFO L226 Difference]: Without dead ends: 103 [2021-08-30 19:05:19,703 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 289.05ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:05:19,703 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 294.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.62ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 341.70ms IncrementalHoareTripleChecker+Time [2021-08-30 19:05:19,703 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 15 Invalid, 536 Unknown, 0 Unchecked, 1.62ms Time], IncrementalHoareTripleChecker [5 Valid, 365 Invalid, 0 Unknown, 166 Unchecked, 341.70ms Time] [2021-08-30 19:05:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-30 19:05:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-08-30 19:05:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 93 states have internal predecessors, (99), 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-30 19:05:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-08-30 19:05:19,705 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 43 [2021-08-30 19:05:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:05:19,706 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-08-30 19:05:19,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:05:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-08-30 19:05:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-30 19:05:19,706 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:05:19,706 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:05:19,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-30 19:05:19,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:05:19,914 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:05:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:05:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1605112573, now seen corresponding path program 1 times [2021-08-30 19:05:19,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:05:19,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063989118] [2021-08-30 19:05:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:05:19,914 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:05:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:05:19,915 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:05:19,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-30 19:05:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:05:20,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 19:05:20,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:05:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:05:20,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:05:20,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:05:20,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063989118] [2021-08-30 19:05:20,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063989118] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:05:20,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:05:20,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2021-08-30 19:05:20,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79910572] [2021-08-30 19:05:20,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 19:05:20,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:05:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 19:05:20,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:05:20,897 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:05:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:05:21,338 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2021-08-30 19:05:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-30 19:05:21,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-08-30 19:05:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:05:21,339 INFO L225 Difference]: With dead ends: 102 [2021-08-30 19:05:21,339 INFO L226 Difference]: Without dead ends: 102 [2021-08-30 19:05:21,340 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 337.22ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:05:21,340 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 366.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.72ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 430.56ms IncrementalHoareTripleChecker+Time [2021-08-30 19:05:21,340 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 10 Invalid, 725 Unknown, 0 Unchecked, 1.72ms Time], IncrementalHoareTripleChecker [8 Valid, 432 Invalid, 0 Unknown, 285 Unchecked, 430.56ms Time] [2021-08-30 19:05:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-30 19:05:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2021-08-30 19:05:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.240506329113924) internal successors, (98), 92 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-30 19:05:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2021-08-30 19:05:21,342 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 43 [2021-08-30 19:05:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:05:21,343 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2021-08-30 19:05:21,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:05:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2021-08-30 19:05:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-30 19:05:21,343 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:05:21,343 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:05:21,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-08-30 19:05:21,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:05:21,554 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:05:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:05:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2094685411, now seen corresponding path program 1 times [2021-08-30 19:05:21,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:05:21,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845922821] [2021-08-30 19:05:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:05:21,555 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:05:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:05:21,556 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:05:21,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-30 19:05:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:05:21,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 19:05:21,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:05:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:05:22,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 19:05:22,509 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:05:22,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845922821] [2021-08-30 19:05:22,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845922821] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 19:05:22,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:05:22,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2021-08-30 19:05:22,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906913698] [2021-08-30 19:05:22,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 19:05:22,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:05:22,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 19:05:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:05:22,510 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:05:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:05:22,911 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-08-30 19:05:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-30 19:05:22,911 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-08-30 19:05:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:05:22,912 INFO L225 Difference]: With dead ends: 101 [2021-08-30 19:05:22,912 INFO L226 Difference]: Without dead ends: 101 [2021-08-30 19:05:22,912 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 296.21ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-08-30 19:05:22,913 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 338.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.31ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 391.95ms IncrementalHoareTripleChecker+Time [2021-08-30 19:05:22,913 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 15 Invalid, 679 Unknown, 0 Unchecked, 1.31ms Time], IncrementalHoareTripleChecker [7 Valid, 468 Invalid, 0 Unknown, 204 Unchecked, 391.95ms Time] [2021-08-30 19:05:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-30 19:05:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2021-08-30 19:05:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 91 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-30 19:05:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-08-30 19:05:22,915 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 43 [2021-08-30 19:05:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:05:22,915 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-08-30 19:05:22,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:05:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-08-30 19:05:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 19:05:22,915 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:05:22,915 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:05:22,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-30 19:05:23,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:05:23,116 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:05:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:05:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1781548922, now seen corresponding path program 1 times [2021-08-30 19:05:23,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:05:23,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747540200] [2021-08-30 19:05:23,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:05:23,117 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:05:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:05:23,117 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:05:23,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-30 19:05:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:05:23,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-30 19:05:23,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:05:23,288 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-30 19:05:23,289 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 24 treesize of output 31 [2021-08-30 19:05:23,395 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 29 treesize of output 25 [2021-08-30 19:05:23,643 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 41 treesize of output 29 [2021-08-30 19:05:23,781 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-30 19:05:23,781 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 50 treesize of output 53 [2021-08-30 19:05:23,870 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-30 19:05:23,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:30,592 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:05:30,592 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 19 treesize of output 18 [2021-08-30 19:05:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:05:30,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:05:30,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747540200] [2021-08-30 19:05:30,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747540200] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:05:30,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:05:30,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-08-30 19:05:30,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137029833] [2021-08-30 19:05:30,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-30 19:05:30,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:05:30,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-30 19:05:30,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=579, Unknown=3, NotChecked=0, Total=650 [2021-08-30 19:05:30,616 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 26 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:05:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:05:36,572 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-08-30 19:05:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-30 19:05:36,573 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2021-08-30 19:05:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:05:36,573 INFO L225 Difference]: With dead ends: 98 [2021-08-30 19:05:36,573 INFO L226 Difference]: Without dead ends: 98 [2021-08-30 19:05:36,574 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 11280.81ms TimeCoverageRelationStatistics Valid=151, Invalid=1106, Unknown=3, NotChecked=0, Total=1260 [2021-08-30 19:05:36,574 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1257.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 1434.16ms IncrementalHoareTripleChecker+Time [2021-08-30 19:05:36,574 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 82 Invalid, 1453 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [13 Valid, 1420 Invalid, 0 Unknown, 20 Unchecked, 1434.16ms Time] [2021-08-30 19:05:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-30 19:05:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-08-30 19:05:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 90 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-30 19:05:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-08-30 19:05:36,576 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 44 [2021-08-30 19:05:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:05:36,576 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-08-30 19:05:36,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:05:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-08-30 19:05:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 19:05:36,577 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:05:36,577 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:05:36,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-08-30 19:05:36,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:05:36,785 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:05:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:05:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1781117946, now seen corresponding path program 1 times [2021-08-30 19:05:36,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:05:36,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109027752] [2021-08-30 19:05:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:05:36,785 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:05:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:05:36,786 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:05:36,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-08-30 19:05:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:05:36,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-30 19:05:36,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:05:36,947 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-30 19:05:36,947 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 28 [2021-08-30 19:05:37,083 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 32 treesize of output 28 [2021-08-30 19:05:37,364 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 54 treesize of output 42 [2021-08-30 19:05:37,537 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-30 19:05:37,537 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 66 treesize of output 69 [2021-08-30 19:05:37,636 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-30 19:05:37,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:44,327 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:05:44,327 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 19 treesize of output 18 [2021-08-30 19:05:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:05:44,348 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:05:44,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109027752] [2021-08-30 19:05:44,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109027752] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:05:44,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 19:05:44,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-08-30 19:05:44,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631088174] [2021-08-30 19:05:44,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-30 19:05:44,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 19:05:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-30 19:05:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=579, Unknown=3, NotChecked=0, Total=650 [2021-08-30 19:05:44,350 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 26 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:05:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:05:45,011 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-08-30 19:05:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-30 19:05:45,012 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2021-08-30 19:05:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:05:45,012 INFO L225 Difference]: With dead ends: 97 [2021-08-30 19:05:45,012 INFO L226 Difference]: Without dead ends: 97 [2021-08-30 19:05:45,013 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 6839.80ms TimeCoverageRelationStatistics Valid=79, Invalid=674, Unknown=3, NotChecked=0, Total=756 [2021-08-30 19:05:45,013 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 510.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 585.95ms IncrementalHoareTripleChecker+Time [2021-08-30 19:05:45,013 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 1044 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [2 Valid, 673 Invalid, 0 Unknown, 369 Unchecked, 585.95ms Time] [2021-08-30 19:05:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-30 19:05:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-08-30 19:05:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 89 states have internal predecessors, (95), 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-30 19:05:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2021-08-30 19:05:45,015 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 44 [2021-08-30 19:05:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:05:45,015 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2021-08-30 19:05:45,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:05:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2021-08-30 19:05:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-30 19:05:45,016 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:05:45,016 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 19:05:45,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-08-30 19:05:45,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:05:45,221 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE === [_destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (and 56 more)] === [2021-08-30 19:05:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:05:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash -510307206, now seen corresponding path program 1 times [2021-08-30 19:05:45,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 19:05:45,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728493071] [2021-08-30 19:05:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:05:45,221 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 19:05:45,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 19:05:45,222 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 19:05:45,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-08-30 19:05:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:05:45,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-30 19:05:45,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:05:45,368 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-30 19:05:45,425 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-30 19:05:45,426 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 20 treesize of output 27 [2021-08-30 19:05:45,584 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-08-30 19:05:45,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 50 [2021-08-30 19:05:45,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-30 19:05:45,793 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 19:05:45,793 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2021-08-30 19:05:46,041 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 19:05:46,041 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 2 case distinctions, treesize of input 60 treesize of output 53 [2021-08-30 19:05:46,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 19:05:46,185 INFO L354 Elim1Store]: treesize reduction 71, result has 11.3 percent of original size [2021-08-30 19:05:46,185 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 4 case distinctions, treesize of input 77 treesize of output 73 [2021-08-30 19:05:47,334 INFO L354 Elim1Store]: treesize reduction 47, result has 7.8 percent of original size [2021-08-30 19:05:47,335 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 128 treesize of output 92 [2021-08-30 19:05:47,643 INFO L354 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2021-08-30 19:05:47,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 94 [2021-08-30 19:05:47,861 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-30 19:05:47,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:49,776 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-08-30 19:05:49,776 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 70 [2021-08-30 19:05:49,823 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-08-30 19:05:49,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 78 [2021-08-30 19:05:49,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-08-30 19:05:49,863 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 19:05:49,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728493071] [2021-08-30 19:05:49,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 19:05:49,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1349644932] [2021-08-30 19:05:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:05:49,864 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-30 19:05:49,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-30 19:05:49,872 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-30 19:05:49,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-08-30 19:05:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:05:50,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-30 19:05:50,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:05:50,065 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-30 19:05:50,122 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-30 19:05:50,122 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 22 treesize of output 29 [2021-08-30 19:05:50,259 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-08-30 19:05:50,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2021-08-30 19:05:50,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-30 19:05:50,521 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 19:05:50,522 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-08-30 19:05:50,835 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 19:05:50,836 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 2 case distinctions, treesize of input 41 treesize of output 38 [2021-08-30 19:05:50,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 19:05:51,019 INFO L354 Elim1Store]: treesize reduction 71, result has 11.3 percent of original size [2021-08-30 19:05:51,019 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 4 case distinctions, treesize of input 58 treesize of output 58 [2021-08-30 19:05:52,430 INFO L354 Elim1Store]: treesize reduction 47, result has 7.8 percent of original size [2021-08-30 19:05:52,431 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 74 treesize of output 42 [2021-08-30 19:05:52,574 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-30 19:05:52,575 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 20 treesize of output 25 [2021-08-30 19:05:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:05:52,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:05:53,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2021-08-30 19:06:00,602 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-08-30 19:06:00,603 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 50 [2021-08-30 19:06:00,634 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-08-30 19:06:00,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2021-08-30 19:06:00,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-08-30 19:06:00,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-30 19:06:00,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-30 19:06:00,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 19:06:00,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722431049] [2021-08-30 19:06:00,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:06:00,738 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:06:00,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:06:00,739 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 19:06:00,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-30 19:06:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:06:00,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-30 19:06:00,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:06:00,978 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-30 19:06:00,979 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 23 treesize of output 30 [2021-08-30 19:06:01,300 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-08-30 19:06:01,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2021-08-30 19:06:01,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-30 19:06:01,525 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 19:06:01,525 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-08-30 19:06:01,816 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-30 19:06:01,817 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 2 case distinctions, treesize of input 41 treesize of output 38 [2021-08-30 19:06:01,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 19:06:02,006 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-08-30 19:06:02,007 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 5 case distinctions, treesize of input 62 treesize of output 62 [2021-08-30 19:06:03,401 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-08-30 19:06:03,401 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 88 treesize of output 48 [2021-08-30 19:06:03,562 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-30 19:06:03,562 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 20 treesize of output 25 [2021-08-30 19:06:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:06:03,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:06:04,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2021-08-30 19:06:06,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (not (= c_dll_circular_create_~last~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~head~0.base)) c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) c_dll_circular_create_~head~0.offset) c_dll_circular_create_~last~0.base) c_dll_circular_create_~head~0.offset)))) is different from false [2021-08-30 19:06:08,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base)) c_dll_circular_create_~new_head~0.base) (bvadd c_dll_circular_create_~new_head~0.offset (_ bv4 32)) c_dll_circular_create_~last~0.base) c_dll_circular_create_~new_head~0.offset) c_dll_circular_create_~last~0.base))) is different from false [2021-08-30 19:06:10,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((dll_circular_create_~last~0.offset (_ BitVec 32)) (dll_circular_create_~head~0.offset (_ BitVec 32))) (not (= c_dll_circular_create_~last~0.base (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_circular_create_~head~0.base) (bvadd (_ bv4 32) dll_circular_create_~head~0.offset) c_dll_circular_create_~new_head~0.base)))) (store .cse0 c_dll_circular_create_~last~0.base (store (select .cse0 c_dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset c_dll_circular_create_~new_head~0.base))) c_dll_circular_create_~new_head~0.base) (bvadd c_dll_circular_create_~new_head~0.offset (_ bv4 32)) c_dll_circular_create_~last~0.base) c_dll_circular_create_~new_head~0.offset)))) is different from false [2021-08-30 19:06:10,244 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-08-30 19:06:10,245 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 50 [2021-08-30 19:06:10,271 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-08-30 19:06:10,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2021-08-30 19:06:10,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-08-30 19:06:10,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-30 19:06:10,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-30 19:06:10,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-30 19:06:10,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:06:10,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-30 19:06:10,368 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-30 19:06:10,368 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-08-30 19:06:10,371 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE (58 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION (57 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION (56 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION (55 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION (54 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE (53 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE (52 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE (51 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE (50 of 59 remaining) [2021-08-30 19:06:10,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE (49 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE (48 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE (47 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE (46 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE (45 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE (44 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE (43 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE (42 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE (41 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE (40 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE (39 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE (38 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE (37 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE (36 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE (35 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE (34 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE (33 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE (32 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE (31 of 59 remaining) [2021-08-30 19:06:10,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE (30 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE (29 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE (28 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE (27 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE (26 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE (25 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE (24 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE (23 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE (22 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE (21 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE (20 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE (19 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE (18 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE (17 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE (16 of 59 remaining) [2021-08-30 19:06:10,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE (15 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE (14 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr0REQUIRES_VIOLATION (12 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr1REQUIRES_VIOLATION (11 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr2REQUIRES_VIOLATION (10 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr3REQUIRES_VIOLATION (9 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr4REQUIRES_VIOLATION (8 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr5REQUIRES_VIOLATION (7 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr6REQUIRES_VIOLATION (6 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr7REQUIRES_VIOLATION (5 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr8REQUIRES_VIOLATION (4 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr9REQUIRES_VIOLATION (3 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr10REQUIRES_VIOLATION (2 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_circular_createErr11REQUIRES_VIOLATION (1 of 59 remaining) [2021-08-30 19:06:10,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK (0 of 59 remaining) [2021-08-30 19:06:10,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2021-08-30 19:06:10,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-08-30 19:06:10,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-08-30 19:06:10,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 19:06:10,980 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 19:06:10,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 07:06:10 BoogieIcfgContainer [2021-08-30 19:06:10,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 19:06:10,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 19:06:10,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 19:06:10,988 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 19:06:10,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:59:56" (3/4) ... [2021-08-30 19:06:10,990 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-30 19:06:10,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 19:06:10,991 INFO L158 Benchmark]: Toolchain (without parser) took 374746.36ms. Allocated memory was 52.4MB in the beginning and 94.4MB in the end (delta: 41.9MB). Free memory was 28.5MB in the beginning and 57.7MB in the end (delta: -29.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2021-08-30 19:06:10,991 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 19:06:10,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.73ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.3MB in the beginning and 42.5MB in the end (delta: -14.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2021-08-30 19:06:10,992 INFO L158 Benchmark]: Boogie Preprocessor took 53.62ms. Allocated memory is still 65.0MB. Free memory was 42.5MB in the beginning and 39.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-30 19:06:10,992 INFO L158 Benchmark]: RCFGBuilder took 378.41ms. Allocated memory is still 65.0MB. Free memory was 39.4MB in the beginning and 34.4MB in the end (delta: 5.0MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2021-08-30 19:06:10,992 INFO L158 Benchmark]: TraceAbstraction took 374003.10ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 34.1MB in the beginning and 57.7MB in the end (delta: -23.6MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2021-08-30 19:06:10,992 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 94.4MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 19:06:10,992 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.10ms. Allocated memory is still 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.73ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.3MB in the beginning and 42.5MB in the end (delta: -14.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.62ms. Allocated memory is still 65.0MB. Free memory was 42.5MB in the beginning and 39.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.41ms. Allocated memory is still 65.0MB. Free memory was 39.4MB in the beginning and 34.4MB in the end (delta: 5.0MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 374003.10ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 34.1MB in the beginning and 57.7MB in the end (delta: -23.6MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 94.4MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L617] const int len = 3; [L618] CALL, EXPR dll_circular_create(len) [L564] DLL last = (DLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) [L568] last->next = last [L569] last->prev = last [L570] DLL head = last; [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] head->prev = new_head [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] head->prev = new_head [L578] head = new_head [L579] len-- [L571] COND FALSE !(len > 1) [L581] last->next = head [L582] head->prev = last [L583] return head; [L618] RET, EXPR dll_circular_create(len) [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) [L586] EXPR head->prev [L586] DLL pred = head->prev; [L587] EXPR head->next [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND TRUE __VERIFIER_nondet_int() [L598] free(succ) [L598] free(succ) [L598] free(succ) [L599] COND FALSE !(__VERIFIER_nondet_int()) [L603] free(pred) [L603] free(pred) [L603] free(pred) - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 159 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 373962.40ms, OverallIterations: 27, TraceHistogramMax: 2, EmptinessCheckTime: 19.02ms, AutomataDifference: 195252.04ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 7.66ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1913 SdHoareTripleChecker+Valid, 19294.66ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1902 mSDsluCounter, 1320 SdHoareTripleChecker+Invalid, 16693.33ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6124 IncrementalHoareTripleChecker+Unchecked, 13511 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19315 IncrementalHoareTripleChecker+Invalid, 25593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 184 mSDtfsCounter, 19315 mSolverCounterSat, 90.34ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1198 SyntacticMatches, 30 SemanticMatches, 493 ConstructedPredicates, 18 IntricatePredicates, 4 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 303946.78ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, InterpolantAutomatonStates: 335, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 111.16ms AutomataMinimizationTime, 26 MinimizatonAttempts, 105 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 157.71ms SsaConstructionTime, 952.49ms SatisfiabilityAnalysisTime, 144802.58ms InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1588 ConstructedInterpolants, 305 QuantifiedInterpolants, 17848 SizeOfPredicates, 213 NumberOfNonLiveVariables, 3212 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 144/254 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 could not prove your program: unable to determine feasibility of some traces [2021-08-30 19:06:11,049 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 0 Received shutdown request...