./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6a59c2161f6b6239c5a03a0c424da05f95a5e0e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/forester-heap/dll-optional-1.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 e6a59c2161f6b6239c5a03a0c424da05f95a5e0e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:29:05,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:29:05,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:29:05,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:29:05,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:29:05,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:29:05,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:29:05,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:29:05,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:29:05,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:29:05,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:29:05,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:29:05,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:29:05,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:29:05,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:29:05,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:29:05,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:29:05,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:29:05,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:29:05,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:29:05,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:29:05,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:29:05,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:29:05,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:29:05,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:29:05,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:29:05,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:29:05,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:29:05,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:29:05,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:29:05,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:29:05,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:29:05,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:29:05,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:29:05,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:29:05,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:29:05,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:29:05,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:29:05,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:29:05,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:29:05,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:29:05,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:29:05,491 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:29:05,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:29:05,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:29:05,492 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:29:05,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:29:05,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:29:05,494 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:29:05,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:29:05,494 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:29:05,495 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:29:05,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:29:05,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:29:05,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:29:05,496 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:29:05,496 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:29:05,496 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:29:05,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:29:05,496 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:29:05,496 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:29:05,497 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:29:05,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:29:05,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:29:05,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:29:05,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:29:05,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:29:05,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:29:05,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:29:05,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:29:05,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:29:05,498 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 -> e6a59c2161f6b6239c5a03a0c424da05f95a5e0e [2021-08-27 06:29:05,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:29:05,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:29:05,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:29:05,791 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:29:05,792 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:29:05,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-08-27 06:29:05,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce6ab097/e301f9bf5f4d497abbada0cfdcc5c2b1/FLAG3d60f8677 [2021-08-27 06:29:06,178 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:29:06,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-08-27 06:29:06,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce6ab097/e301f9bf5f4d497abbada0cfdcc5c2b1/FLAG3d60f8677 [2021-08-27 06:29:06,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce6ab097/e301f9bf5f4d497abbada0cfdcc5c2b1 [2021-08-27 06:29:06,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:29:06,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:29:06,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:29:06,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:29:06,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:29:06,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6493447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06, skipping insertion in model container [2021-08-27 06:29:06,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:29:06,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:29:06,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-08-27 06:29:06,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:29:06,783 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:29:06,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-08-27 06:29:06,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:29:06,840 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:29:06,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06 WrapperNode [2021-08-27 06:29:06,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:29:06,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:29:06,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:29:06,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:29:06,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:29:06,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:29:06,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:29:06,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:29:06,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (1/1) ... [2021-08-27 06:29:06,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:29:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:06,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:29:06,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:29:07,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:29:07,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:29:07,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:29:07,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:29:07,008 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:29:07,009 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:29:07,009 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:29:07,009 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:29:07,009 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:29:07,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:29:07,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:29:07,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:29:07,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:29:07,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:29:07,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:29:07,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:29:07,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:29:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:29:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:29:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:29:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:29:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:29:07,015 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:29:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:29:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:29:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:29:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:29:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:29:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:29:07,016 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:29:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:29:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:29:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:29:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:29:07,019 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:29:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:29:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:29:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:29:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:29:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:29:07,021 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:29:07,022 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:29:07,022 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:29:07,022 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:29:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:29:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:29:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:29:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:29:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:29:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:29:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:29:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:29:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:29:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:29:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:29:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:29:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:29:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:29:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:29:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:29:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:29:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:29:07,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:29:07,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:29:07,617 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 06:29:07,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:29:07 BoogieIcfgContainer [2021-08-27 06:29:07,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:29:07,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:29:07,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:29:07,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:29:07,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:29:06" (1/3) ... [2021-08-27 06:29:07,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e930942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:29:07, skipping insertion in model container [2021-08-27 06:29:07,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:06" (2/3) ... [2021-08-27 06:29:07,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e930942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:29:07, skipping insertion in model container [2021-08-27 06:29:07,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:29:07" (3/3) ... [2021-08-27 06:29:07,624 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2021-08-27 06:29:07,627 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:29:07,627 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-08-27 06:29:07,653 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:29:07,657 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:29:07,657 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-08-27 06:29:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 81 states have (on average 2.0987654320987654) internal successors, (170), 153 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:29:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:29:07,672 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:07,673 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:07,673 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2128307418, now seen corresponding path program 1 times [2021-08-27 06:29:07,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:07,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590665421] [2021-08-27 06:29:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:07,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:07,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:07,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590665421] [2021-08-27 06:29:07,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590665421] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:07,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:07,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:29:07,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541362602] [2021-08-27 06:29:07,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:29:07,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:07,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:29:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:07,828 INFO L87 Difference]: Start difference. First operand has 158 states, 81 states have (on average 2.0987654320987654) internal successors, (170), 153 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:08,050 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2021-08-27 06:29:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:29:08,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:29:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:08,058 INFO L225 Difference]: With dead ends: 158 [2021-08-27 06:29:08,058 INFO L226 Difference]: Without dead ends: 154 [2021-08-27 06:29:08,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-27 06:29:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2021-08-27 06:29:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.891566265060241) internal successors, (157), 144 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2021-08-27 06:29:08,085 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 7 [2021-08-27 06:29:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:08,086 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2021-08-27 06:29:08,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2021-08-27 06:29:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:29:08,086 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:08,087 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:08,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:29:08,087 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2128307419, now seen corresponding path program 1 times [2021-08-27 06:29:08,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:08,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870735623] [2021-08-27 06:29:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:08,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:08,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:08,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870735623] [2021-08-27 06:29:08,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870735623] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:08,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:08,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:29:08,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465601469] [2021-08-27 06:29:08,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:29:08,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:08,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:29:08,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:08,155 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:08,347 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2021-08-27 06:29:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:29:08,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:29:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:08,348 INFO L225 Difference]: With dead ends: 143 [2021-08-27 06:29:08,348 INFO L226 Difference]: Without dead ends: 143 [2021-08-27 06:29:08,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-27 06:29:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2021-08-27 06:29:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 83 states have (on average 1.783132530120482) internal successors, (148), 135 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2021-08-27 06:29:08,354 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 7 [2021-08-27 06:29:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:08,355 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2021-08-27 06:29:08,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2021-08-27 06:29:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:29:08,356 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:08,356 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:08,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:29:08,356 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash -536268575, now seen corresponding path program 1 times [2021-08-27 06:29:08,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:08,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681270671] [2021-08-27 06:29:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:08,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:08,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:08,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681270671] [2021-08-27 06:29:08,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681270671] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:08,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:08,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:08,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976511138] [2021-08-27 06:29:08,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:29:08,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:08,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:29:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:08,425 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:08,664 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2021-08-27 06:29:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:29:08,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:29:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:08,666 INFO L225 Difference]: With dead ends: 183 [2021-08-27 06:29:08,666 INFO L226 Difference]: Without dead ends: 183 [2021-08-27 06:29:08,666 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.5ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-08-27 06:29:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2021-08-27 06:29:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.7710843373493976) internal successors, (147), 134 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2021-08-27 06:29:08,672 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 16 [2021-08-27 06:29:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:08,672 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2021-08-27 06:29:08,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2021-08-27 06:29:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:29:08,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:08,673 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:08,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:29:08,673 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash -536268574, now seen corresponding path program 1 times [2021-08-27 06:29:08,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:08,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997560066] [2021-08-27 06:29:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:08,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:08,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:08,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997560066] [2021-08-27 06:29:08,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997560066] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:08,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:08,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:08,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101147296] [2021-08-27 06:29:08,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:29:08,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:29:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:08,767 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:08,981 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2021-08-27 06:29:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:29:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:29:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:08,983 INFO L225 Difference]: With dead ends: 137 [2021-08-27 06:29:08,983 INFO L226 Difference]: Without dead ends: 137 [2021-08-27 06:29:08,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-27 06:29:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-08-27 06:29:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 83 states have (on average 1.7590361445783131) internal successors, (146), 133 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-08-27 06:29:08,987 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 16 [2021-08-27 06:29:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:08,987 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-08-27 06:29:08,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-08-27 06:29:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:29:08,988 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:08,988 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:08,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:29:08,988 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash 306357193, now seen corresponding path program 1 times [2021-08-27 06:29:08,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:08,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741608000] [2021-08-27 06:29:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:08,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:09,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:09,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741608000] [2021-08-27 06:29:09,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741608000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:09,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:09,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:29:09,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366956536] [2021-08-27 06:29:09,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:09,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:09,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:09,043 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:09,230 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2021-08-27 06:29:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:29:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:29:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:09,231 INFO L225 Difference]: With dead ends: 138 [2021-08-27 06:29:09,231 INFO L226 Difference]: Without dead ends: 138 [2021-08-27 06:29:09,232 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-08-27 06:29:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2021-08-27 06:29:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 125 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2021-08-27 06:29:09,236 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 17 [2021-08-27 06:29:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:09,236 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2021-08-27 06:29:09,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2021-08-27 06:29:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:29:09,236 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:09,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:09,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:29:09,237 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:09,237 INFO L82 PathProgramCache]: Analyzing trace with hash 306357194, now seen corresponding path program 1 times [2021-08-27 06:29:09,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:09,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302659505] [2021-08-27 06:29:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:09,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:09,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:09,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302659505] [2021-08-27 06:29:09,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302659505] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:09,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:09,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:29:09,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833213818] [2021-08-27 06:29:09,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:09,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:09,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:09,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:09,363 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:09,596 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2021-08-27 06:29:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:29:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:29:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:09,597 INFO L225 Difference]: With dead ends: 166 [2021-08-27 06:29:09,597 INFO L226 Difference]: Without dead ends: 166 [2021-08-27 06:29:09,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-27 06:29:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2021-08-27 06:29:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 149 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2021-08-27 06:29:09,601 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 17 [2021-08-27 06:29:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:09,601 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2021-08-27 06:29:09,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2021-08-27 06:29:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:29:09,602 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:09,602 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:09,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:29:09,602 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:09,602 INFO L82 PathProgramCache]: Analyzing trace with hash -118328575, now seen corresponding path program 1 times [2021-08-27 06:29:09,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:09,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997246107] [2021-08-27 06:29:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:09,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:09,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:09,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997246107] [2021-08-27 06:29:09,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997246107] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:09,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:09,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:09,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043593483] [2021-08-27 06:29:09,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:29:09,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:29:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:09,648 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:09,826 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2021-08-27 06:29:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:29:09,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:29:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:09,827 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:29:09,827 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 06:29:09,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 06:29:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-08-27 06:29:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 148 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2021-08-27 06:29:09,831 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 20 [2021-08-27 06:29:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:09,831 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2021-08-27 06:29:09,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2021-08-27 06:29:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:29:09,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:09,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:09,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:29:09,832 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:09,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:09,832 INFO L82 PathProgramCache]: Analyzing trace with hash -118328574, now seen corresponding path program 1 times [2021-08-27 06:29:09,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:09,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747303681] [2021-08-27 06:29:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:09,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:09,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:09,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747303681] [2021-08-27 06:29:09,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747303681] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:09,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:09,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:09,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985824711] [2021-08-27 06:29:09,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:29:09,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:29:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:09,893 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:10,091 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2021-08-27 06:29:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:29:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:29:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:10,092 INFO L225 Difference]: With dead ends: 151 [2021-08-27 06:29:10,092 INFO L226 Difference]: Without dead ends: 151 [2021-08-27 06:29:10,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-08-27 06:29:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-08-27 06:29:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 147 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2021-08-27 06:29:10,095 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 20 [2021-08-27 06:29:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:10,095 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2021-08-27 06:29:10,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2021-08-27 06:29:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:29:10,096 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:10,096 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:10,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:29:10,096 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr71ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2038755480, now seen corresponding path program 1 times [2021-08-27 06:29:10,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:10,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833808010] [2021-08-27 06:29:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:10,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:10,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:10,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833808010] [2021-08-27 06:29:10,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833808010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:10,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:10,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:10,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040325427] [2021-08-27 06:29:10,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:10,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:10,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:10,138 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:10,301 INFO L93 Difference]: Finished difference Result 180 states and 200 transitions. [2021-08-27 06:29:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:29:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:29:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:10,302 INFO L225 Difference]: With dead ends: 180 [2021-08-27 06:29:10,302 INFO L226 Difference]: Without dead ends: 180 [2021-08-27 06:29:10,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-27 06:29:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2021-08-27 06:29:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 147 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2021-08-27 06:29:10,305 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 22 [2021-08-27 06:29:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:10,305 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2021-08-27 06:29:10,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2021-08-27 06:29:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:29:10,305 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:10,305 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:10,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:29:10,306 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2069583293, now seen corresponding path program 1 times [2021-08-27 06:29:10,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:10,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763803157] [2021-08-27 06:29:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:10,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:10,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:10,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763803157] [2021-08-27 06:29:10,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763803157] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:10,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:10,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:29:10,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113965160] [2021-08-27 06:29:10,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:29:10,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:29:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:29:10,394 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:10,760 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2021-08-27 06:29:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:29:10,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:29:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:10,761 INFO L225 Difference]: With dead ends: 153 [2021-08-27 06:29:10,761 INFO L226 Difference]: Without dead ends: 153 [2021-08-27 06:29:10,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 104.8ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:29:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-08-27 06:29:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2021-08-27 06:29:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 146 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2021-08-27 06:29:10,763 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 24 [2021-08-27 06:29:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:10,763 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2021-08-27 06:29:10,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2021-08-27 06:29:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:29:10,764 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:10,764 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:10,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:29:10,764 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:10,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2069583292, now seen corresponding path program 1 times [2021-08-27 06:29:10,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:10,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965233756] [2021-08-27 06:29:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:10,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:10,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:10,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965233756] [2021-08-27 06:29:10,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965233756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:10,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:10,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:29:10,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945870124] [2021-08-27 06:29:10,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:29:10,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:10,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:29:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:29:10,881 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:11,406 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2021-08-27 06:29:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:29:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:29:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:11,408 INFO L225 Difference]: With dead ends: 144 [2021-08-27 06:29:11,408 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 06:29:11,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 260.8ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:29:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 06:29:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2021-08-27 06:29:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.4) internal successors, (147), 127 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2021-08-27 06:29:11,411 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 24 [2021-08-27 06:29:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:11,411 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2021-08-27 06:29:11,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2021-08-27 06:29:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:29:11,414 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:11,414 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:11,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:29:11,414 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1803961082, now seen corresponding path program 1 times [2021-08-27 06:29:11,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:11,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944222686] [2021-08-27 06:29:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:11,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:11,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:11,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:11,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944222686] [2021-08-27 06:29:11,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944222686] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:11,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:11,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:11,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835011154] [2021-08-27 06:29:11,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:11,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:11,484 INFO L87 Difference]: Start difference. First operand 131 states and 150 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:11,579 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2021-08-27 06:29:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:29:11,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:29:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:11,580 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:29:11,580 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:29:11,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:29:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2021-08-27 06:29:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.385321100917431) internal successors, (151), 131 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2021-08-27 06:29:11,585 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 25 [2021-08-27 06:29:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:11,586 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2021-08-27 06:29:11,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2021-08-27 06:29:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:29:11,594 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:11,594 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:11,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:29:11,594 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1497737079, now seen corresponding path program 1 times [2021-08-27 06:29:11,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:11,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019030086] [2021-08-27 06:29:11,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:11,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:11,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:11,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019030086] [2021-08-27 06:29:11,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019030086] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:11,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:11,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:29:11,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140861531] [2021-08-27 06:29:11,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:29:11,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:29:11,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:11,697 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:12,013 INFO L93 Difference]: Finished difference Result 268 states and 312 transitions. [2021-08-27 06:29:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 06:29:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:29:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:12,015 INFO L225 Difference]: With dead ends: 268 [2021-08-27 06:29:12,015 INFO L226 Difference]: Without dead ends: 268 [2021-08-27 06:29:12,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 89.4ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:29:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-08-27 06:29:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 145. [2021-08-27 06:29:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 141 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2021-08-27 06:29:12,020 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 27 [2021-08-27 06:29:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:12,020 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2021-08-27 06:29:12,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2021-08-27 06:29:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:29:12,021 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:12,022 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:12,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 06:29:12,022 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1551563773, now seen corresponding path program 1 times [2021-08-27 06:29:12,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:12,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613172348] [2021-08-27 06:29:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:12,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:12,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:12,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613172348] [2021-08-27 06:29:12,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613172348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:12,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:12,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:29:12,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347111059] [2021-08-27 06:29:12,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:29:12,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:29:12,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:12,083 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:12,164 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2021-08-27 06:29:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:29:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:29:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:12,166 INFO L225 Difference]: With dead ends: 147 [2021-08-27 06:29:12,166 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 06:29:12,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 06:29:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-08-27 06:29:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 143 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2021-08-27 06:29:12,182 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 27 [2021-08-27 06:29:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:12,182 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2021-08-27 06:29:12,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2021-08-27 06:29:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:29:12,183 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:12,183 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:12,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 06:29:12,183 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -697494680, now seen corresponding path program 1 times [2021-08-27 06:29:12,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:12,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297067674] [2021-08-27 06:29:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:12,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:12,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:12,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297067674] [2021-08-27 06:29:12,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297067674] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:12,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:12,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:29:12,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863741737] [2021-08-27 06:29:12,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:29:12,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:29:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:12,317 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:12,605 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2021-08-27 06:29:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:29:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:29:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:12,613 INFO L225 Difference]: With dead ends: 224 [2021-08-27 06:29:12,613 INFO L226 Difference]: Without dead ends: 224 [2021-08-27 06:29:12,614 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 107.6ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:29:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-08-27 06:29:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 190. [2021-08-27 06:29:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 164 states have (on average 1.3902439024390243) internal successors, (228), 186 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 231 transitions. [2021-08-27 06:29:12,618 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 231 transitions. Word has length 29 [2021-08-27 06:29:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:12,618 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 231 transitions. [2021-08-27 06:29:12,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 231 transitions. [2021-08-27 06:29:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:29:12,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:12,619 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:12,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:29:12,619 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash 447420343, now seen corresponding path program 1 times [2021-08-27 06:29:12,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:12,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81791680] [2021-08-27 06:29:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:12,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:12,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:12,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81791680] [2021-08-27 06:29:12,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81791680] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:12,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:12,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:29:12,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587218299] [2021-08-27 06:29:12,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:29:12,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:12,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:29:12,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:29:12,748 INFO L87 Difference]: Start difference. First operand 190 states and 231 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:13,150 INFO L93 Difference]: Finished difference Result 328 states and 378 transitions. [2021-08-27 06:29:13,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:29:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:29:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:13,152 INFO L225 Difference]: With dead ends: 328 [2021-08-27 06:29:13,152 INFO L226 Difference]: Without dead ends: 328 [2021-08-27 06:29:13,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 105.1ms TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-08-27 06:29:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-08-27 06:29:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 203. [2021-08-27 06:29:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 177 states have (on average 1.384180790960452) internal successors, (245), 199 states have internal predecessors, (245), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 248 transitions. [2021-08-27 06:29:13,156 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 248 transitions. Word has length 31 [2021-08-27 06:29:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:13,157 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 248 transitions. [2021-08-27 06:29:13,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 248 transitions. [2021-08-27 06:29:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:29:13,158 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:13,158 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:13,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 06:29:13,158 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr53REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash 447420344, now seen corresponding path program 1 times [2021-08-27 06:29:13,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:13,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313247829] [2021-08-27 06:29:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:13,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:13,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:13,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313247829] [2021-08-27 06:29:13,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313247829] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:13,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:13,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:29:13,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404597511] [2021-08-27 06:29:13,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:29:13,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:29:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:29:13,357 INFO L87 Difference]: Start difference. First operand 203 states and 248 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:13,899 INFO L93 Difference]: Finished difference Result 293 states and 347 transitions. [2021-08-27 06:29:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 06:29:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:29:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:13,900 INFO L225 Difference]: With dead ends: 293 [2021-08-27 06:29:13,900 INFO L226 Difference]: Without dead ends: 293 [2021-08-27 06:29:13,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 182.6ms TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:29:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-08-27 06:29:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 211. [2021-08-27 06:29:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 185 states have (on average 1.372972972972973) internal successors, (254), 207 states have internal predecessors, (254), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 257 transitions. [2021-08-27 06:29:13,917 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 257 transitions. Word has length 31 [2021-08-27 06:29:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:13,917 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 257 transitions. [2021-08-27 06:29:13,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 257 transitions. [2021-08-27 06:29:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:29:13,918 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:13,918 INFO L512 BasicCegarLoop]: trace histogram [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-27 06:29:13,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 06:29:13,918 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1726087730, now seen corresponding path program 1 times [2021-08-27 06:29:13,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:13,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587796318] [2021-08-27 06:29:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:13,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:13,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:13,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587796318] [2021-08-27 06:29:13,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587796318] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:13,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:13,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:13,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668062033] [2021-08-27 06:29:13,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:13,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:13,979 INFO L87 Difference]: Start difference. First operand 211 states and 257 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:14,070 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2021-08-27 06:29:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:29:14,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:29:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:14,072 INFO L225 Difference]: With dead ends: 233 [2021-08-27 06:29:14,084 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 06:29:14,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 06:29:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2021-08-27 06:29:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 215 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2021-08-27 06:29:14,088 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 31 [2021-08-27 06:29:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:14,089 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2021-08-27 06:29:14,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2021-08-27 06:29:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:29:14,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:14,089 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:14,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 06:29:14,090 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash -143116081, now seen corresponding path program 1 times [2021-08-27 06:29:14,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:14,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767903475] [2021-08-27 06:29:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:14,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:14,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:14,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767903475] [2021-08-27 06:29:14,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767903475] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:14,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:14,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:14,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674029610] [2021-08-27 06:29:14,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:29:14,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:29:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:14,152 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:14,299 INFO L93 Difference]: Finished difference Result 228 states and 274 transitions. [2021-08-27 06:29:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:29:14,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 06:29:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:14,301 INFO L225 Difference]: With dead ends: 228 [2021-08-27 06:29:14,301 INFO L226 Difference]: Without dead ends: 228 [2021-08-27 06:29:14,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-08-27 06:29:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 218. [2021-08-27 06:29:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 193 states have (on average 1.3471502590673574) internal successors, (260), 214 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 263 transitions. [2021-08-27 06:29:14,317 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 263 transitions. Word has length 32 [2021-08-27 06:29:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:14,317 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 263 transitions. [2021-08-27 06:29:14,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 263 transitions. [2021-08-27 06:29:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:29:14,318 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:14,318 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:14,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 06:29:14,318 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr37REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash -143116080, now seen corresponding path program 1 times [2021-08-27 06:29:14,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:14,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186093965] [2021-08-27 06:29:14,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:14,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:14,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:14,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186093965] [2021-08-27 06:29:14,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186093965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:14,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:14,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:29:14,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993620619] [2021-08-27 06:29:14,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:29:14,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:14,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:29:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:14,400 INFO L87 Difference]: Start difference. First operand 218 states and 263 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:14,570 INFO L93 Difference]: Finished difference Result 217 states and 262 transitions. [2021-08-27 06:29:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:29:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 06:29:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:14,572 INFO L225 Difference]: With dead ends: 217 [2021-08-27 06:29:14,572 INFO L226 Difference]: Without dead ends: 217 [2021-08-27 06:29:14,572 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 36.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-08-27 06:29:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-08-27 06:29:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 193 states have (on average 1.3419689119170986) internal successors, (259), 213 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2021-08-27 06:29:14,576 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 32 [2021-08-27 06:29:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:14,576 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2021-08-27 06:29:14,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2021-08-27 06:29:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:29:14,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:14,577 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:14,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 06:29:14,578 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash -734563416, now seen corresponding path program 1 times [2021-08-27 06:29:14,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:14,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267807558] [2021-08-27 06:29:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:14,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:14,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:14,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267807558] [2021-08-27 06:29:14,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267807558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:14,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:14,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:29:14,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902235544] [2021-08-27 06:29:14,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:29:14,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:29:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:29:14,687 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:15,157 INFO L93 Difference]: Finished difference Result 289 states and 335 transitions. [2021-08-27 06:29:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 06:29:15,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-08-27 06:29:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:15,158 INFO L225 Difference]: With dead ends: 289 [2021-08-27 06:29:15,158 INFO L226 Difference]: Without dead ends: 289 [2021-08-27 06:29:15,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 129.0ms TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-08-27 06:29:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-27 06:29:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 215. [2021-08-27 06:29:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 191 states have (on average 1.3403141361256545) internal successors, (256), 211 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 259 transitions. [2021-08-27 06:29:15,162 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 259 transitions. Word has length 33 [2021-08-27 06:29:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:15,162 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 259 transitions. [2021-08-27 06:29:15,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 259 transitions. [2021-08-27 06:29:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:29:15,163 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:15,163 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 06:29:15,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 06:29:15,164 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash -252325197, now seen corresponding path program 1 times [2021-08-27 06:29:15,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:15,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493005780] [2021-08-27 06:29:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:15,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:15,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:15,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:15,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493005780] [2021-08-27 06:29:15,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493005780] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:15,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804605379] [2021-08-27 06:29:15,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:15,243 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:15,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:15,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:15,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 06:29:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:15,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-27 06:29:15,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:15,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:29:15,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:29:15,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:29:15,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:29:15,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,626 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:29:15,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:29:15,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:29:15,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,665 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:29:15,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 06:29:15,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:15,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 06:29:16,133 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-08-27 06:29:16,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 50 [2021-08-27 06:29:16,150 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-08-27 06:29:16,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 25 [2021-08-27 06:29:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:16,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804605379] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:16,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:16,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2021-08-27 06:29:16,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135790068] [2021-08-27 06:29:16,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:29:16,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:29:16,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:29:16,167 INFO L87 Difference]: Start difference. First operand 215 states and 259 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:16,654 INFO L93 Difference]: Finished difference Result 221 states and 247 transitions. [2021-08-27 06:29:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 06:29:16,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 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 33 [2021-08-27 06:29:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:16,656 INFO L225 Difference]: With dead ends: 221 [2021-08-27 06:29:16,656 INFO L226 Difference]: Without dead ends: 221 [2021-08-27 06:29:16,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 257.1ms TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-08-27 06:29:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-08-27 06:29:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2021-08-27 06:29:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 189 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 224 transitions. [2021-08-27 06:29:16,660 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 224 transitions. Word has length 33 [2021-08-27 06:29:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:16,660 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 224 transitions. [2021-08-27 06:29:16,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2021-08-27 06:29:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:29:16,661 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:16,661 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:16,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:16,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-27 06:29:16,880 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash 158286245, now seen corresponding path program 1 times [2021-08-27 06:29:16,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:16,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950733724] [2021-08-27 06:29:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:16,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:16,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:16,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:16,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950733724] [2021-08-27 06:29:16,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950733724] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:16,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:16,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:29:16,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003857866] [2021-08-27 06:29:16,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:29:16,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:16,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:29:16,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:29:16,967 INFO L87 Difference]: Start difference. First operand 193 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:17,241 INFO L93 Difference]: Finished difference Result 241 states and 275 transitions. [2021-08-27 06:29:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:29:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 06:29:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:17,243 INFO L225 Difference]: With dead ends: 241 [2021-08-27 06:29:17,243 INFO L226 Difference]: Without dead ends: 241 [2021-08-27 06:29:17,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 96.8ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:29:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-08-27 06:29:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 199. [2021-08-27 06:29:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 175 states have (on average 1.302857142857143) internal successors, (228), 195 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2021-08-27 06:29:17,247 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 35 [2021-08-27 06:29:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:17,247 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2021-08-27 06:29:17,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2021-08-27 06:29:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:29:17,248 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:17,248 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:17,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 06:29:17,248 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:17,249 INFO L82 PathProgramCache]: Analyzing trace with hash 131941045, now seen corresponding path program 1 times [2021-08-27 06:29:17,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:17,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066255737] [2021-08-27 06:29:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:17,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:17,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:17,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066255737] [2021-08-27 06:29:17,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066255737] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:17,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:17,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:29:17,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393529580] [2021-08-27 06:29:17,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:17,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:17,309 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:17,470 INFO L93 Difference]: Finished difference Result 231 states and 259 transitions. [2021-08-27 06:29:17,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:29:17,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-08-27 06:29:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:17,472 INFO L225 Difference]: With dead ends: 231 [2021-08-27 06:29:17,472 INFO L226 Difference]: Without dead ends: 231 [2021-08-27 06:29:17,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-08-27 06:29:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 194. [2021-08-27 06:29:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 190 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2021-08-27 06:29:17,475 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 37 [2021-08-27 06:29:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:17,475 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2021-08-27 06:29:17,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2021-08-27 06:29:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:29:17,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:17,476 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:17,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 06:29:17,476 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1989340234, now seen corresponding path program 1 times [2021-08-27 06:29:17,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:17,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938915420] [2021-08-27 06:29:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:17,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:17,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:17,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:17,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938915420] [2021-08-27 06:29:17,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938915420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:17,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:17,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 06:29:17,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144534422] [2021-08-27 06:29:17,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:29:17,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:17,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:29:17,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:29:17,675 INFO L87 Difference]: Start difference. First operand 194 states and 223 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:18,430 INFO L93 Difference]: Finished difference Result 231 states and 259 transitions. [2021-08-27 06:29:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 06:29:18,431 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:29:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:18,432 INFO L225 Difference]: With dead ends: 231 [2021-08-27 06:29:18,432 INFO L226 Difference]: Without dead ends: 231 [2021-08-27 06:29:18,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 333.5ms TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2021-08-27 06:29:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-08-27 06:29:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 191. [2021-08-27 06:29:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 187 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 218 transitions. [2021-08-27 06:29:18,435 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 218 transitions. Word has length 38 [2021-08-27 06:29:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:18,435 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 218 transitions. [2021-08-27 06:29:18,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 218 transitions. [2021-08-27 06:29:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 06:29:18,435 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:18,435 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:18,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 06:29:18,436 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr69ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash 760764660, now seen corresponding path program 1 times [2021-08-27 06:29:18,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:18,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15505610] [2021-08-27 06:29:18,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:18,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:18,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:18,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:18,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15505610] [2021-08-27 06:29:18,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15505610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:18,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:18,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:29:18,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073226456] [2021-08-27 06:29:18,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:18,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:18,476 INFO L87 Difference]: Start difference. First operand 191 states and 218 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:18,637 INFO L93 Difference]: Finished difference Result 208 states and 229 transitions. [2021-08-27 06:29:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:29:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 06:29:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:18,638 INFO L225 Difference]: With dead ends: 208 [2021-08-27 06:29:18,639 INFO L226 Difference]: Without dead ends: 208 [2021-08-27 06:29:18,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-27 06:29:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2021-08-27 06:29:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 189 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2021-08-27 06:29:18,642 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 40 [2021-08-27 06:29:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:18,642 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2021-08-27 06:29:18,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2021-08-27 06:29:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 06:29:18,642 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:18,642 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:18,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 06:29:18,643 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr65ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 760753675, now seen corresponding path program 1 times [2021-08-27 06:29:18,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:18,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598511745] [2021-08-27 06:29:18,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:18,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:18,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:18,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598511745] [2021-08-27 06:29:18,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598511745] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:18,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:18,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:29:18,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574506143] [2021-08-27 06:29:18,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:29:18,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:29:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:18,702 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:18,890 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2021-08-27 06:29:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:29:18,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 06:29:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:18,891 INFO L225 Difference]: With dead ends: 239 [2021-08-27 06:29:18,891 INFO L226 Difference]: Without dead ends: 239 [2021-08-27 06:29:18,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:29:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-27 06:29:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 210. [2021-08-27 06:29:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 186 states have (on average 1.2634408602150538) internal successors, (235), 206 states have internal predecessors, (235), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2021-08-27 06:29:18,894 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 238 transitions. Word has length 40 [2021-08-27 06:29:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:18,894 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 238 transitions. [2021-08-27 06:29:18,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 238 transitions. [2021-08-27 06:29:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 06:29:18,895 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:18,895 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:18,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 06:29:18,895 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr66ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2108527701, now seen corresponding path program 1 times [2021-08-27 06:29:18,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:18,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659015095] [2021-08-27 06:29:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:18,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:19,028 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-27 06:29:19,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:19,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659015095] [2021-08-27 06:29:19,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659015095] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:19,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242805290] [2021-08-27 06:29:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:19,029 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:19,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:19,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:19,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 06:29:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:19,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 06:29:19,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:19,754 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-08-27 06:29:19,754 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 26 treesize of output 19 [2021-08-27 06:29:19,771 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-27 06:29:19,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242805290] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:19,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:19,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2021-08-27 06:29:19,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852049761] [2021-08-27 06:29:19,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 06:29:19,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:19,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 06:29:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-08-27 06:29:19,773 INFO L87 Difference]: Start difference. First operand 210 states and 238 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:21,045 INFO L93 Difference]: Finished difference Result 360 states and 392 transitions. [2021-08-27 06:29:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 06:29:21,045 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 41 [2021-08-27 06:29:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:21,046 INFO L225 Difference]: With dead ends: 360 [2021-08-27 06:29:21,046 INFO L226 Difference]: Without dead ends: 360 [2021-08-27 06:29:21,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 782.2ms TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 06:29:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-08-27 06:29:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 286. [2021-08-27 06:29:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 262 states have (on average 1.3015267175572518) internal successors, (341), 282 states have internal predecessors, (341), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 344 transitions. [2021-08-27 06:29:21,051 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 344 transitions. Word has length 41 [2021-08-27 06:29:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:21,051 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 344 transitions. [2021-08-27 06:29:21,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 344 transitions. [2021-08-27 06:29:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 06:29:21,051 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:21,052 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:21,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:21,260 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,SelfDestructingSolverStorable27 [2021-08-27 06:29:21,261 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1674248020, now seen corresponding path program 1 times [2021-08-27 06:29:21,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:21,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558477400] [2021-08-27 06:29:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:21,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:21,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:21,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558477400] [2021-08-27 06:29:21,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558477400] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:21,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099159205] [2021-08-27 06:29:21,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:21,588 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:21,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:21,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:21,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 06:29:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:21,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 06:29:21,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:21,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:29:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:29:21,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:21,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:29:21,963 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:29:21,963 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-27 06:29:21,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:21,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 06:29:22,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-08-27 06:29:22,105 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:29:22,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 52 [2021-08-27 06:29:22,115 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-08-27 06:29:22,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2021-08-27 06:29:22,187 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:29:22,187 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2021-08-27 06:29:22,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 06:29:22,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 06:29:22,348 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 06:29:22,348 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 29 [2021-08-27 06:29:22,495 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:29:22,496 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 28 treesize of output 14 [2021-08-27 06:29:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:22,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099159205] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:22,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:22,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-08-27 06:29:22,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345475062] [2021-08-27 06:29:22,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-27 06:29:22,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-27 06:29:22,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2021-08-27 06:29:22,543 INFO L87 Difference]: Start difference. First operand 286 states and 344 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:24,843 INFO L93 Difference]: Finished difference Result 720 states and 841 transitions. [2021-08-27 06:29:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-27 06:29:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 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 42 [2021-08-27 06:29:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:24,845 INFO L225 Difference]: With dead ends: 720 [2021-08-27 06:29:24,845 INFO L226 Difference]: Without dead ends: 720 [2021-08-27 06:29:24,846 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 1421.9ms TimeCoverageRelationStatistics Valid=628, Invalid=3794, Unknown=0, NotChecked=0, Total=4422 [2021-08-27 06:29:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-08-27 06:29:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 344. [2021-08-27 06:29:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 320 states have (on average 1.278125) internal successors, (409), 340 states have internal predecessors, (409), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 412 transitions. [2021-08-27 06:29:24,852 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 412 transitions. Word has length 42 [2021-08-27 06:29:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:24,852 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 412 transitions. [2021-08-27 06:29:24,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 412 transitions. [2021-08-27 06:29:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 06:29:24,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:24,853 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:24,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:25,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-08-27 06:29:25,073 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr53REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1973248347, now seen corresponding path program 1 times [2021-08-27 06:29:25,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:25,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96854508] [2021-08-27 06:29:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:25,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:25,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:25,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96854508] [2021-08-27 06:29:25,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96854508] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:25,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592161157] [2021-08-27 06:29:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:25,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:25,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:25,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 06:29:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:25,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-27 06:29:25,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:25,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:29:25,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:29:25,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:29:25,805 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:29:25,806 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-27 06:29:25,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:25,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:29:25,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:25,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-08-27 06:29:25,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:25,983 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-08-27 06:29:25,984 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 76 treesize of output 65 [2021-08-27 06:29:25,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:25,998 INFO L354 Elim1Store]: treesize reduction 78, result has 17.9 percent of original size [2021-08-27 06:29:25,999 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 68 treesize of output 66 [2021-08-27 06:29:26,276 INFO L354 Elim1Store]: treesize reduction 118, result has 21.3 percent of original size [2021-08-27 06:29:26,278 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 94 treesize of output 96 [2021-08-27 06:29:26,302 INFO L354 Elim1Store]: treesize reduction 138, result has 20.7 percent of original size [2021-08-27 06:29:26,302 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 107 [2021-08-27 06:29:27,059 INFO L354 Elim1Store]: treesize reduction 136, result has 15.0 percent of original size [2021-08-27 06:29:27,060 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 84 [2021-08-27 06:29:27,081 INFO L354 Elim1Store]: treesize reduction 136, result has 15.0 percent of original size [2021-08-27 06:29:27,082 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 69 [2021-08-27 06:29:27,140 INFO L354 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2021-08-27 06:29:27,141 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 107 treesize of output 87 [2021-08-27 06:29:27,162 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-08-27 06:29:27,163 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 100 [2021-08-27 06:29:27,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:29:27,575 INFO L354 Elim1Store]: treesize reduction 111, result has 2.6 percent of original size [2021-08-27 06:29:27,577 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 65 [2021-08-27 06:29:27,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:29:27,590 INFO L354 Elim1Store]: treesize reduction 111, result has 2.6 percent of original size [2021-08-27 06:29:27,590 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 29 [2021-08-27 06:29:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:27,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592161157] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:27,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:27,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2021-08-27 06:29:27,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131053493] [2021-08-27 06:29:27,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-27 06:29:27,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:27,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-27 06:29:27,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=690, Unknown=1, NotChecked=0, Total=812 [2021-08-27 06:29:27,639 INFO L87 Difference]: Start difference. First operand 344 states and 412 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:41,669 INFO L93 Difference]: Finished difference Result 519 states and 608 transitions. [2021-08-27 06:29:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-27 06:29:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 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 42 [2021-08-27 06:29:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:41,670 INFO L225 Difference]: With dead ends: 519 [2021-08-27 06:29:41,670 INFO L226 Difference]: Without dead ends: 519 [2021-08-27 06:29:41,671 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 5704.6ms TimeCoverageRelationStatistics Valid=649, Invalid=3373, Unknown=10, NotChecked=0, Total=4032 [2021-08-27 06:29:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-08-27 06:29:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 342. [2021-08-27 06:29:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 318 states have (on average 1.2735849056603774) internal successors, (405), 338 states have internal predecessors, (405), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 408 transitions. [2021-08-27 06:29:41,676 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 408 transitions. Word has length 42 [2021-08-27 06:29:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:41,676 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 408 transitions. [2021-08-27 06:29:41,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 408 transitions. [2021-08-27 06:29:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 06:29:41,676 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:41,676 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:41,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:41,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:41,877 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash -602170694, now seen corresponding path program 1 times [2021-08-27 06:29:41,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:41,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997622441] [2021-08-27 06:29:41,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:41,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:41,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:41,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997622441] [2021-08-27 06:29:41,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997622441] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:41,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476047228] [2021-08-27 06:29:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:41,982 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:41,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:41,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 06:29:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:42,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-27 06:29:42,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:42,701 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:29:42,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2021-08-27 06:29:42,706 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:29:42,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-08-27 06:29:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:42,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476047228] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:42,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:42,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-08-27 06:29:42,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865135700] [2021-08-27 06:29:42,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:29:42,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:42,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:29:42,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:29:42,745 INFO L87 Difference]: Start difference. First operand 342 states and 408 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:43,460 INFO L93 Difference]: Finished difference Result 492 states and 587 transitions. [2021-08-27 06:29:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:29:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 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 43 [2021-08-27 06:29:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:43,462 INFO L225 Difference]: With dead ends: 492 [2021-08-27 06:29:43,462 INFO L226 Difference]: Without dead ends: 492 [2021-08-27 06:29:43,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 294.4ms TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:29:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-08-27 06:29:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 380. [2021-08-27 06:29:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 356 states have (on average 1.2724719101123596) internal successors, (453), 376 states have internal predecessors, (453), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 456 transitions. [2021-08-27 06:29:43,467 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 456 transitions. Word has length 43 [2021-08-27 06:29:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:43,467 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 456 transitions. [2021-08-27 06:29:43,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 456 transitions. [2021-08-27 06:29:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 06:29:43,467 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:43,467 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:43,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:43,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:43,668 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash 451605341, now seen corresponding path program 1 times [2021-08-27 06:29:43,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:43,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701610824] [2021-08-27 06:29:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:43,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:44,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:44,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:44,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701610824] [2021-08-27 06:29:44,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701610824] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:44,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11455891] [2021-08-27 06:29:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:44,036 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:44,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:44,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:44,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 06:29:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:44,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-27 06:29:44,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:44,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:29:44,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:29:44,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:29:44,577 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:29:44,578 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-27 06:29:44,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-08-27 06:29:44,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:44,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:44,607 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 0 case distinctions, treesize of input 20 treesize of output 24 [2021-08-27 06:29:44,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-08-27 06:29:44,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:44,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:44,617 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 0 case distinctions, treesize of input 16 treesize of output 20 [2021-08-27 06:29:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:44,717 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-08-27 06:29:44,717 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 69 treesize of output 58 [2021-08-27 06:29:44,728 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:29:44,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-08-27 06:29:44,966 INFO L354 Elim1Store]: treesize reduction 118, result has 21.3 percent of original size [2021-08-27 06:29:44,966 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 87 treesize of output 89 [2021-08-27 06:29:44,989 INFO L354 Elim1Store]: treesize reduction 86, result has 25.2 percent of original size [2021-08-27 06:29:44,989 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 97 [2021-08-27 06:29:45,168 INFO L354 Elim1Store]: treesize reduction 70, result has 27.8 percent of original size [2021-08-27 06:29:45,169 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 33 [2021-08-27 06:29:45,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:45,218 INFO L354 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2021-08-27 06:29:45,218 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 5 case distinctions, treesize of input 56 treesize of output 42 [2021-08-27 06:29:45,299 INFO L354 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2021-08-27 06:29:45,300 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 100 treesize of output 80 [2021-08-27 06:29:45,316 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:29:45,316 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 90 [2021-08-27 06:29:45,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:29:45,834 INFO L354 Elim1Store]: treesize reduction 111, result has 2.6 percent of original size [2021-08-27 06:29:45,834 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 58 [2021-08-27 06:29:45,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:29:45,843 INFO L354 Elim1Store]: treesize reduction 67, result has 4.3 percent of original size [2021-08-27 06:29:45,844 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 23 [2021-08-27 06:29:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:45,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11455891] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:45,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:45,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 24 [2021-08-27 06:29:45,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413863063] [2021-08-27 06:29:45,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 06:29:45,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:45,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 06:29:45,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:29:45,863 INFO L87 Difference]: Start difference. First operand 380 states and 456 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:48,871 INFO L93 Difference]: Finished difference Result 551 states and 649 transitions. [2021-08-27 06:29:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-27 06:29:48,872 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 44 [2021-08-27 06:29:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:48,873 INFO L225 Difference]: With dead ends: 551 [2021-08-27 06:29:48,873 INFO L226 Difference]: Without dead ends: 551 [2021-08-27 06:29:48,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1518.8ms TimeCoverageRelationStatistics Valid=394, Invalid=1763, Unknown=5, NotChecked=0, Total=2162 [2021-08-27 06:29:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-08-27 06:29:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2021-08-27 06:29:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 363 states have (on average 1.2672176308539944) internal successors, (460), 383 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 463 transitions. [2021-08-27 06:29:48,878 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 463 transitions. Word has length 44 [2021-08-27 06:29:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:48,879 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 463 transitions. [2021-08-27 06:29:48,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 463 transitions. [2021-08-27 06:29:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 06:29:48,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:48,879 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:48,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:49,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:49,089 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr71ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1487423079, now seen corresponding path program 1 times [2021-08-27 06:29:49,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:49,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355032045] [2021-08-27 06:29:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:49,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:49,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:49,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355032045] [2021-08-27 06:29:49,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355032045] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:49,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444798403] [2021-08-27 06:29:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:49,156 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:49,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:49,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 06:29:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:49,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:29:49,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:49,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444798403] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:49,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:49,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-27 06:29:49,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429706057] [2021-08-27 06:29:49,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:29:49,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:29:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:29:49,871 INFO L87 Difference]: Start difference. First operand 387 states and 463 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:50,074 INFO L93 Difference]: Finished difference Result 399 states and 474 transitions. [2021-08-27 06:29:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:29:50,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 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 44 [2021-08-27 06:29:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:50,076 INFO L225 Difference]: With dead ends: 399 [2021-08-27 06:29:50,076 INFO L226 Difference]: Without dead ends: 364 [2021-08-27 06:29:50,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 70.9ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:29:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-08-27 06:29:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-08-27 06:29:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 340 states have (on average 1.276470588235294) internal successors, (434), 360 states have internal predecessors, (434), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 437 transitions. [2021-08-27 06:29:50,080 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 437 transitions. Word has length 44 [2021-08-27 06:29:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:50,080 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 437 transitions. [2021-08-27 06:29:50,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 437 transitions. [2021-08-27 06:29:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:29:50,081 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:50,081 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:50,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:50,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:50,282 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:29:50,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:50,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2042169452, now seen corresponding path program 1 times [2021-08-27 06:29:50,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:50,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796867874] [2021-08-27 06:29:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:50,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:50,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:50,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796867874] [2021-08-27 06:29:50,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796867874] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:50,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469314024] [2021-08-27 06:29:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:50,634 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:50,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:50,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:29:50,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 06:29:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:51,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-27 06:29:51,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:51,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:29:51,207 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:29:51,208 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-27 06:29:51,242 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 23 treesize of output 19 [2021-08-27 06:29:51,336 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:29:51,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2021-08-27 06:29:51,483 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-08-27 06:29:51,483 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 28 treesize of output 45 [2021-08-27 06:29:51,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:51,585 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 06:29:51,585 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 65 treesize of output 52 [2021-08-27 06:29:51,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:29:51,810 INFO L354 Elim1Store]: treesize reduction 116, result has 17.1 percent of original size [2021-08-27 06:29:51,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 64 [2021-08-27 06:29:52,169 INFO L354 Elim1Store]: treesize reduction 182, result has 17.6 percent of original size [2021-08-27 06:29:52,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 86 [2021-08-27 06:29:52,445 INFO L354 Elim1Store]: treesize reduction 208, result has 13.0 percent of original size [2021-08-27 06:29:52,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 68 [2021-08-27 06:29:52,527 INFO L354 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2021-08-27 06:29:52,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 77 [2021-08-27 06:29:55,657 INFO L354 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2021-08-27 06:29:55,658 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 101 treesize of output 49 [2021-08-27 06:29:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:55,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469314024] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:55,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:55,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-08-27 06:29:55,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808231924] [2021-08-27 06:29:55,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-27 06:29:55,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-27 06:29:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=865, Unknown=3, NotChecked=0, Total=1056 [2021-08-27 06:29:55,709 INFO L87 Difference]: Start difference. First operand 364 states and 437 transitions. Second operand has 33 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:23,675 INFO L93 Difference]: Finished difference Result 786 states and 949 transitions. [2021-08-27 06:30:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-27 06:30:23,676 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 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 46 [2021-08-27 06:30:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:23,678 INFO L225 Difference]: With dead ends: 786 [2021-08-27 06:30:23,678 INFO L226 Difference]: Without dead ends: 786 [2021-08-27 06:30:23,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 9011.4ms TimeCoverageRelationStatistics Valid=826, Invalid=3590, Unknown=6, NotChecked=0, Total=4422 [2021-08-27 06:30:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-08-27 06:30:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 392. [2021-08-27 06:30:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 368 states have (on average 1.2717391304347827) internal successors, (468), 388 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 471 transitions. [2021-08-27 06:30:23,684 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 471 transitions. Word has length 46 [2021-08-27 06:30:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:23,684 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 471 transitions. [2021-08-27 06:30:23,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 471 transitions. [2021-08-27 06:30:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:30:23,685 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:23,685 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:30:23,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:23,886 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,SelfDestructingSolverStorable33 [2021-08-27 06:30:23,886 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr53REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:30:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2042169453, now seen corresponding path program 1 times [2021-08-27 06:30:23,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:30:23,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213682442] [2021-08-27 06:30:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:23,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:30:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:30:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:24,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:30:24,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213682442] [2021-08-27 06:30:24,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213682442] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:30:24,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914389060] [2021-08-27 06:30:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:24,369 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:30:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:30:24,370 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:30:24,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 06:30:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:25,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 54 conjunts are in the unsatisfiable core [2021-08-27 06:30:25,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:25,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:30:25,074 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:30:25,075 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-27 06:30:25,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:30:25,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:30:25,134 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 28 treesize of output 24 [2021-08-27 06:30:25,208 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:30:25,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 54 [2021-08-27 06:30:25,215 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:30:25,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2021-08-27 06:30:25,366 INFO L354 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2021-08-27 06:30:25,367 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 18 treesize of output 20 [2021-08-27 06:30:25,385 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-08-27 06:30:25,385 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 22 treesize of output 24 [2021-08-27 06:30:25,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:25,481 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 06:30:25,482 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 98 treesize of output 79 [2021-08-27 06:30:25,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:25,491 INFO L354 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2021-08-27 06:30:25,491 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 99 treesize of output 101 [2021-08-27 06:30:25,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:25,686 INFO L354 Elim1Store]: treesize reduction 116, result has 17.1 percent of original size [2021-08-27 06:30:25,687 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 100 [2021-08-27 06:30:25,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:25,710 INFO L354 Elim1Store]: treesize reduction 170, result has 15.0 percent of original size [2021-08-27 06:30:25,710 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 5 case distinctions, treesize of input 129 treesize of output 130 [2021-08-27 06:30:26,049 INFO L354 Elim1Store]: treesize reduction 182, result has 17.6 percent of original size [2021-08-27 06:30:26,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 129 [2021-08-27 06:30:26,096 INFO L354 Elim1Store]: treesize reduction 210, result has 17.6 percent of original size [2021-08-27 06:30:26,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 149 [2021-08-27 06:30:27,164 INFO L354 Elim1Store]: treesize reduction 108, result has 12.2 percent of original size [2021-08-27 06:30:27,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 108 [2021-08-27 06:30:27,184 INFO L354 Elim1Store]: treesize reduction 144, result has 12.7 percent of original size [2021-08-27 06:30:27,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 110 [2021-08-27 06:30:27,274 INFO L354 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2021-08-27 06:30:27,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 166 treesize of output 120 [2021-08-27 06:30:27,314 INFO L354 Elim1Store]: treesize reduction 260, result has 13.6 percent of original size [2021-08-27 06:30:27,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 162 [2021-08-27 06:30:28,138 INFO L354 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2021-08-27 06:30:28,139 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 152 treesize of output 88 [2021-08-27 06:30:28,146 INFO L354 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2021-08-27 06:30:28,146 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 44 [2021-08-27 06:30:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:28,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914389060] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:30:28,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:30:28,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2021-08-27 06:30:28,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432860632] [2021-08-27 06:30:28,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-27 06:30:28,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:30:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-27 06:30:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=973, Unknown=1, NotChecked=0, Total=1122 [2021-08-27 06:30:28,186 INFO L87 Difference]: Start difference. First operand 392 states and 471 transitions. Second operand has 34 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 33 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:45,235 INFO L93 Difference]: Finished difference Result 633 states and 761 transitions. [2021-08-27 06:30:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 06:30:45,235 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 33 states have internal predecessors, (80), 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 46 [2021-08-27 06:30:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:45,237 INFO L225 Difference]: With dead ends: 633 [2021-08-27 06:30:45,237 INFO L226 Difference]: Without dead ends: 633 [2021-08-27 06:30:45,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 6896.0ms TimeCoverageRelationStatistics Valid=451, Invalid=2512, Unknown=7, NotChecked=0, Total=2970 [2021-08-27 06:30:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-08-27 06:30:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 392. [2021-08-27 06:30:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 368 states have (on average 1.2690217391304348) internal successors, (467), 388 states have internal predecessors, (467), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2021-08-27 06:30:45,249 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 46 [2021-08-27 06:30:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:45,250 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2021-08-27 06:30:45,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 33 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2021-08-27 06:30:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:30:45,250 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:45,251 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:30:45,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:45,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-08-27 06:30:45,465 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:30:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash 639739822, now seen corresponding path program 1 times [2021-08-27 06:30:45,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:30:45,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193506873] [2021-08-27 06:30:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:45,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:30:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:30:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:45,597 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-27 06:30:45,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:30:45,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193506873] [2021-08-27 06:30:45,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193506873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:30:45,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:30:45,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 06:30:45,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37407981] [2021-08-27 06:30:45,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:30:45,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:30:45,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:30:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:30:45,598 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:45,880 INFO L93 Difference]: Finished difference Result 412 states and 489 transitions. [2021-08-27 06:30:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:30:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-08-27 06:30:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:45,881 INFO L225 Difference]: With dead ends: 412 [2021-08-27 06:30:45,881 INFO L226 Difference]: Without dead ends: 407 [2021-08-27 06:30:45,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 100.7ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:30:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-08-27 06:30:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2021-08-27 06:30:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 359 states have (on average 1.2729805013927578) internal successors, (457), 379 states have internal predecessors, (457), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 460 transitions. [2021-08-27 06:30:45,885 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 460 transitions. Word has length 46 [2021-08-27 06:30:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:45,885 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 460 transitions. [2021-08-27 06:30:45,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 460 transitions. [2021-08-27 06:30:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:30:45,885 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:45,886 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:30:45,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 06:30:45,886 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:30:45,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash -797850508, now seen corresponding path program 1 times [2021-08-27 06:30:45,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:30:45,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929286652] [2021-08-27 06:30:45,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:45,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:30:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:30:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:46,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:30:46,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929286652] [2021-08-27 06:30:46,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929286652] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:30:46,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277856187] [2021-08-27 06:30:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:46,230 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:30:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:30:46,230 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:30:46,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 06:30:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:47,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-27 06:30:47,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:47,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:30:47,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:30:47,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:30:47,199 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:30:47,200 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-27 06:30:47,253 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 06:30:47,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2021-08-27 06:30:47,269 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 06:30:47,269 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 21 treesize of output 26 [2021-08-27 06:30:47,444 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-08-27 06:30:47,445 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 81 treesize of output 70 [2021-08-27 06:30:47,454 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:30:47,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2021-08-27 06:30:47,856 INFO L354 Elim1Store]: treesize reduction 118, result has 21.3 percent of original size [2021-08-27 06:30:47,857 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 94 treesize of output 96 [2021-08-27 06:30:47,876 INFO L354 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2021-08-27 06:30:47,876 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 89 [2021-08-27 06:30:48,148 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:30:48,148 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 2 case distinctions, treesize of input 90 treesize of output 80 [2021-08-27 06:30:48,156 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:30:48,156 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 1 case distinctions, treesize of input 71 treesize of output 58 [2021-08-27 06:30:48,227 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:30:48,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-27 06:30:48,297 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-08-27 06:30:48,298 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 2 case distinctions, treesize of input 82 treesize of output 87 [2021-08-27 06:30:48,306 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:30:48,306 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 1 case distinctions, treesize of input 75 treesize of output 77 [2021-08-27 06:30:48,638 INFO L354 Elim1Store]: treesize reduction 174, result has 19.8 percent of original size [2021-08-27 06:30:48,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 146 treesize of output 114 [2021-08-27 06:30:48,660 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:30:48,660 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 121 [2021-08-27 06:30:55,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:30:55,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:30:55,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-08-27 06:30:55,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208316062] [2021-08-27 06:30:55,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 06:30:55,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:30:55,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 06:30:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=988, Unknown=2, NotChecked=0, Total=1122 [2021-08-27 06:30:55,363 INFO L87 Difference]: Start difference. First operand 383 states and 460 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:56,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:56,411 INFO L93 Difference]: Finished difference Result 636 states and 774 transitions. [2021-08-27 06:30:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 06:30:56,411 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-08-27 06:30:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:56,413 INFO L225 Difference]: With dead ends: 636 [2021-08-27 06:30:56,413 INFO L226 Difference]: Without dead ends: 636 [2021-08-27 06:30:56,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 4945.4ms TimeCoverageRelationStatistics Valid=288, Invalid=2057, Unknown=7, NotChecked=0, Total=2352 [2021-08-27 06:30:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-08-27 06:30:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 403. [2021-08-27 06:30:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 379 states have (on average 1.2691292875989446) internal successors, (481), 399 states have internal predecessors, (481), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 484 transitions. [2021-08-27 06:30:56,419 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 484 transitions. Word has length 46 [2021-08-27 06:30:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:56,420 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 484 transitions. [2021-08-27 06:30:56,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 484 transitions. [2021-08-27 06:30:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:30:56,420 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:56,420 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:30:56,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:56,640 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,SelfDestructingSolverStorable36 [2021-08-27 06:30:56,641 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr53REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:30:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash -797850507, now seen corresponding path program 1 times [2021-08-27 06:30:56,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:30:56,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562523288] [2021-08-27 06:30:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:56,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:30:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:30:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:57,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:30:57,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562523288] [2021-08-27 06:30:57,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562523288] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:30:57,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551307913] [2021-08-27 06:30:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:57,319 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:30:57,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:30:57,320 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:30:57,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 06:30:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:58,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-27 06:30:58,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:58,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:30:58,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:30:58,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:30:58,403 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:30:58,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 06:30:58,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:58,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:30:58,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:58,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-08-27 06:30:58,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:58,612 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-08-27 06:30:58,612 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 69 treesize of output 58 [2021-08-27 06:30:58,621 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:30:58,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-08-27 06:30:58,889 INFO L354 Elim1Store]: treesize reduction 118, result has 21.3 percent of original size [2021-08-27 06:30:58,889 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 85 treesize of output 87 [2021-08-27 06:30:58,914 INFO L354 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2021-08-27 06:30:58,914 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 80 [2021-08-27 06:30:59,047 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:30:59,048 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 2 case distinctions, treesize of input 46 treesize of output 36 [2021-08-27 06:30:59,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:59,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:59,079 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:30:59,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-27 06:30:59,148 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-08-27 06:30:59,149 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 2 case distinctions, treesize of input 44 treesize of output 49 [2021-08-27 06:30:59,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:59,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 06:31:04,924 INFO L354 Elim1Store]: treesize reduction 174, result has 19.8 percent of original size [2021-08-27 06:31:04,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 100 [2021-08-27 06:31:04,941 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:31:04,941 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 103 [2021-08-27 06:31:21,167 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:31:21,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:31:21,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-08-27 06:31:21,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522252343] [2021-08-27 06:31:21,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 06:31:21,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:31:21,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 06:31:21,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=911, Unknown=8, NotChecked=0, Total=1056 [2021-08-27 06:31:21,168 INFO L87 Difference]: Start difference. First operand 403 states and 484 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:31:30,801 INFO L93 Difference]: Finished difference Result 583 states and 695 transitions. [2021-08-27 06:31:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-27 06:31:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-08-27 06:31:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:31:30,802 INFO L225 Difference]: With dead ends: 583 [2021-08-27 06:31:30,802 INFO L226 Difference]: Without dead ends: 583 [2021-08-27 06:31:30,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 30107.7ms TimeCoverageRelationStatistics Valid=485, Invalid=3044, Unknown=11, NotChecked=0, Total=3540 [2021-08-27 06:31:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-08-27 06:31:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 397. [2021-08-27 06:31:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 373 states have (on average 1.2680965147453083) internal successors, (473), 393 states have internal predecessors, (473), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 476 transitions. [2021-08-27 06:31:30,808 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 476 transitions. Word has length 46 [2021-08-27 06:31:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:31:30,808 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 476 transitions. [2021-08-27 06:31:30,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 476 transitions. [2021-08-27 06:31:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 06:31:30,809 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:31:30,809 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:31:30,830 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-27 06:31:31,028 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,SelfDestructingSolverStorable37 [2021-08-27 06:31:31,028 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr65ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:31:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:31:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1792660994, now seen corresponding path program 1 times [2021-08-27 06:31:31,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:31:31,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121838849] [2021-08-27 06:31:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:31,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:31:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:31:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:31,159 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-27 06:31:31,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:31:31,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121838849] [2021-08-27 06:31:31,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121838849] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:31:31,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368880816] [2021-08-27 06:31:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:31,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:31:31,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:31:31,160 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:31:31,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 06:31:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:32,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:31:32,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:31:32,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:31:32,242 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:31:32,243 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-27 06:31:32,272 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 18 treesize of output 14 [2021-08-27 06:31:32,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:31:32,293 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 20 treesize of output 8 [2021-08-27 06:31:32,308 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:31:32,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-08-27 06:31:32,866 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:31:32,867 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 26 treesize of output 14 [2021-08-27 06:31:32,869 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-27 06:31:32,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368880816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:31:32,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:31:32,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2021-08-27 06:31:32,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025165221] [2021-08-27 06:31:32,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:31:32,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:31:32,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:31:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:31:32,871 INFO L87 Difference]: Start difference. First operand 397 states and 476 transitions. Second operand has 16 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:31:33,568 INFO L93 Difference]: Finished difference Result 421 states and 500 transitions. [2021-08-27 06:31:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 06:31:33,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 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 47 [2021-08-27 06:31:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:31:33,569 INFO L225 Difference]: With dead ends: 421 [2021-08-27 06:31:33,570 INFO L226 Difference]: Without dead ends: 421 [2021-08-27 06:31:33,570 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 421.9ms TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2021-08-27 06:31:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-08-27 06:31:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 405. [2021-08-27 06:31:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 381 states have (on average 1.2650918635170603) internal successors, (482), 401 states have internal predecessors, (482), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 485 transitions. [2021-08-27 06:31:33,574 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 485 transitions. Word has length 47 [2021-08-27 06:31:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:31:33,574 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 485 transitions. [2021-08-27 06:31:33,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 485 transitions. [2021-08-27 06:31:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:31:33,575 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:31:33,575 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:31:33,597 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-27 06:31:33,794 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,SelfDestructingSolverStorable38 [2021-08-27 06:31:33,795 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:31:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:31:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1483994339, now seen corresponding path program 1 times [2021-08-27 06:31:33,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:31:33,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125553831] [2021-08-27 06:31:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:33,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:31:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:31:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:31:34,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:31:34,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125553831] [2021-08-27 06:31:34,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125553831] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:31:34,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703936761] [2021-08-27 06:31:34,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:34,143 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:31:34,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:31:34,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:31:34,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 06:31:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:35,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-27 06:31:35,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:31:35,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:31:35,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:31:35,394 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:31:35,394 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-27 06:31:35,406 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 18 treesize of output 14 [2021-08-27 06:31:35,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:35,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:31:35,447 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 20 treesize of output 8 [2021-08-27 06:31:35,461 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-08-27 06:31:35,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-08-27 06:31:35,515 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:31:35,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 06:31:35,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-08-27 06:31:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:35,548 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 25 treesize of output 13 [2021-08-27 06:31:35,626 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:31:35,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 52 [2021-08-27 06:31:35,633 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-08-27 06:31:35,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2021-08-27 06:31:35,685 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:31:35,686 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2021-08-27 06:31:35,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 06:31:35,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 06:31:35,787 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 06:31:35,787 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 29 [2021-08-27 06:31:35,880 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:31:35,880 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 28 treesize of output 14 [2021-08-27 06:31:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:31:35,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703936761] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:31:35,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:31:35,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2021-08-27 06:31:35,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738827443] [2021-08-27 06:31:35,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-27 06:31:35,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:31:35,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-27 06:31:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2021-08-27 06:31:35,894 INFO L87 Difference]: Start difference. First operand 405 states and 485 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:31:37,066 INFO L93 Difference]: Finished difference Result 726 states and 871 transitions. [2021-08-27 06:31:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 06:31:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 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 48 [2021-08-27 06:31:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:31:37,068 INFO L225 Difference]: With dead ends: 726 [2021-08-27 06:31:37,068 INFO L226 Difference]: Without dead ends: 726 [2021-08-27 06:31:37,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 777.3ms TimeCoverageRelationStatistics Valid=494, Invalid=2586, Unknown=0, NotChecked=0, Total=3080 [2021-08-27 06:31:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-08-27 06:31:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 405. [2021-08-27 06:31:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 381 states have (on average 1.26246719160105) internal successors, (481), 401 states have internal predecessors, (481), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 484 transitions. [2021-08-27 06:31:37,074 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 484 transitions. Word has length 48 [2021-08-27 06:31:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:31:37,074 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 484 transitions. [2021-08-27 06:31:37,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 484 transitions. [2021-08-27 06:31:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:31:37,075 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:31:37,075 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:31:37,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 06:31:37,295 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,SelfDestructingSolverStorable39 [2021-08-27 06:31:37,295 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr66ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:31:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:31:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -262083778, now seen corresponding path program 1 times [2021-08-27 06:31:37,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:31:37,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392027639] [2021-08-27 06:31:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:37,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:31:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:31:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:37,474 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-27 06:31:37,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:31:37,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392027639] [2021-08-27 06:31:37,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392027639] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:31:37,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104479766] [2021-08-27 06:31:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:37,474 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:31:37,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:31:37,487 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:31:37,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-27 06:31:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:38,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-27 06:31:38,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:31:38,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:31:38,730 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:31:38,731 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-27 06:31:38,741 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 23 treesize of output 19 [2021-08-27 06:31:38,779 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:31:38,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2021-08-27 06:31:39,201 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:31:39,201 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-08-27 06:31:39,205 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-27 06:31:39,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104479766] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:31:39,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:31:39,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-08-27 06:31:39,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066006797] [2021-08-27 06:31:39,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:31:39,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:31:39,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:31:39,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:31:39,206 INFO L87 Difference]: Start difference. First operand 405 states and 484 transitions. Second operand has 18 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:31:39,706 INFO L93 Difference]: Finished difference Result 419 states and 497 transitions. [2021-08-27 06:31:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 06:31:39,707 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 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 48 [2021-08-27 06:31:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:31:39,708 INFO L225 Difference]: With dead ends: 419 [2021-08-27 06:31:39,708 INFO L226 Difference]: Without dead ends: 419 [2021-08-27 06:31:39,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 347.8ms TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:31:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-08-27 06:31:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 405. [2021-08-27 06:31:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 381 states have (on average 1.26246719160105) internal successors, (481), 401 states have internal predecessors, (481), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 484 transitions. [2021-08-27 06:31:39,728 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 484 transitions. Word has length 48 [2021-08-27 06:31:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:31:39,729 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 484 transitions. [2021-08-27 06:31:39,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 484 transitions. [2021-08-27 06:31:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:31:39,730 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:31:39,730 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:31:39,753 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-27 06:31:39,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:31:39,953 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:31:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:31:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash 856024357, now seen corresponding path program 1 times [2021-08-27 06:31:39,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:31:39,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658044606] [2021-08-27 06:31:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:39,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:31:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:31:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:31:40,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:31:40,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658044606] [2021-08-27 06:31:40,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658044606] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:31:40,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479288933] [2021-08-27 06:31:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:40,428 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:31:40,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:31:40,429 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:31:40,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 06:31:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:41,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-27 06:31:41,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:31:41,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:31:41,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:31:41,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:31:41,779 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:31:41,779 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-27 06:31:41,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-08-27 06:31:41,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:41,803 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 0 case distinctions, treesize of input 16 treesize of output 20 [2021-08-27 06:31:41,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-08-27 06:31:41,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:41,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:41,812 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 0 case distinctions, treesize of input 20 treesize of output 24 [2021-08-27 06:31:41,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:41,914 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-08-27 06:31:41,914 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 69 treesize of output 58 [2021-08-27 06:31:41,922 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:31:41,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-08-27 06:31:42,211 INFO L354 Elim1Store]: treesize reduction 118, result has 21.3 percent of original size [2021-08-27 06:31:42,212 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 87 treesize of output 89 [2021-08-27 06:31:42,231 INFO L354 Elim1Store]: treesize reduction 86, result has 25.2 percent of original size [2021-08-27 06:31:42,232 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 97 [2021-08-27 06:31:42,396 INFO L354 Elim1Store]: treesize reduction 136, result has 15.0 percent of original size [2021-08-27 06:31:42,397 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 42 [2021-08-27 06:31:42,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:42,423 INFO L354 Elim1Store]: treesize reduction 45, result has 29.7 percent of original size [2021-08-27 06:31:42,423 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 36 treesize of output 33 [2021-08-27 06:31:42,484 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:31:42,485 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-27 06:31:42,566 INFO L354 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2021-08-27 06:31:42,566 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 55 [2021-08-27 06:31:42,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:31:42,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 06:31:51,224 INFO L354 Elim1Store]: treesize reduction 174, result has 19.8 percent of original size [2021-08-27 06:31:51,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 102 [2021-08-27 06:31:51,248 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:31:51,248 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 105 [2021-08-27 06:32:08,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:32:08,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:32:08,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-08-27 06:32:08,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801436963] [2021-08-27 06:32:08,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:32:08,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:32:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:32:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=672, Unknown=10, NotChecked=0, Total=812 [2021-08-27 06:32:08,072 INFO L87 Difference]: Start difference. First operand 405 states and 484 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:19,291 INFO L93 Difference]: Finished difference Result 556 states and 661 transitions. [2021-08-27 06:32:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 06:32:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-08-27 06:32:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:19,293 INFO L225 Difference]: With dead ends: 556 [2021-08-27 06:32:19,293 INFO L226 Difference]: Without dead ends: 556 [2021-08-27 06:32:19,293 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 34672.1ms TimeCoverageRelationStatistics Valid=278, Invalid=1595, Unknown=19, NotChecked=0, Total=1892 [2021-08-27 06:32:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-08-27 06:32:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 398. [2021-08-27 06:32:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 374 states have (on average 1.2620320855614973) internal successors, (472), 394 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 475 transitions. [2021-08-27 06:32:19,297 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 475 transitions. Word has length 48 [2021-08-27 06:32:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:19,297 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 475 transitions. [2021-08-27 06:32:19,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 475 transitions. [2021-08-27 06:32:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:32:19,298 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:19,298 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:19,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:19,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:19,506 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:32:19,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash 48803880, now seen corresponding path program 1 times [2021-08-27 06:32:19,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:32:19,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709934106] [2021-08-27 06:32:19,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:19,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:32:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:32:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:19,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:32:19,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709934106] [2021-08-27 06:32:19,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709934106] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:19,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325998589] [2021-08-27 06:32:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:19,707 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:19,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:32:19,708 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:32:19,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 06:32:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:20,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-27 06:32:20,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:20,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:32:20,965 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:32:20,965 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-27 06:32:20,993 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-27 06:32:21,061 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:32:21,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-08-27 06:32:21,187 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:32:21,188 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 49 treesize of output 48 [2021-08-27 06:32:21,273 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:32:21,273 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 1 case distinctions, treesize of input 34 treesize of output 21 [2021-08-27 06:32:21,295 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:32:21,295 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 54 treesize of output 39 [2021-08-27 06:32:21,541 INFO L354 Elim1Store]: treesize reduction 68, result has 4.2 percent of original size [2021-08-27 06:32:21,542 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36 [2021-08-27 06:32:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:21,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325998589] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:21,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:32:21,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2021-08-27 06:32:21,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509178278] [2021-08-27 06:32:21,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-27 06:32:21,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:32:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-27 06:32:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2021-08-27 06:32:21,592 INFO L87 Difference]: Start difference. First operand 398 states and 475 transitions. Second operand has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:22,552 INFO L93 Difference]: Finished difference Result 672 states and 796 transitions. [2021-08-27 06:32:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 06:32:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 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 48 [2021-08-27 06:32:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:22,554 INFO L225 Difference]: With dead ends: 672 [2021-08-27 06:32:22,554 INFO L226 Difference]: Without dead ends: 672 [2021-08-27 06:32:22,555 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 561.4ms TimeCoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2021-08-27 06:32:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-08-27 06:32:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 443. [2021-08-27 06:32:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 419 states have (on average 1.2577565632458234) internal successors, (527), 439 states have internal predecessors, (527), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 530 transitions. [2021-08-27 06:32:22,560 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 530 transitions. Word has length 48 [2021-08-27 06:32:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:22,560 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 530 transitions. [2021-08-27 06:32:22,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 530 transitions. [2021-08-27 06:32:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:32:22,561 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:22,561 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:22,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:22,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:22,782 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr47REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:32:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 48803881, now seen corresponding path program 1 times [2021-08-27 06:32:22,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:32:22,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854894652] [2021-08-27 06:32:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:22,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:32:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:32:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:23,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:32:23,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854894652] [2021-08-27 06:32:23,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854894652] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:23,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848849101] [2021-08-27 06:32:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:23,027 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:32:23,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:32:23,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 06:32:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:24,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-27 06:32:24,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:24,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:32:24,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:32:24,524 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:32:24,524 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-27 06:32:24,579 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-27 06:32:24,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:24,679 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:32:24,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:32:24,691 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:32:24,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:32:24,874 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:32:24,874 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 80 treesize of output 75 [2021-08-27 06:32:24,892 INFO L354 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2021-08-27 06:32:24,892 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 68 [2021-08-27 06:32:25,027 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:32:25,028 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 1 case distinctions, treesize of input 34 treesize of output 21 [2021-08-27 06:32:25,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:25,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2021-08-27 06:32:25,070 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:32:25,070 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 93 treesize of output 66 [2021-08-27 06:32:25,089 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 06:32:25,090 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 83 [2021-08-27 06:32:25,611 INFO L354 Elim1Store]: treesize reduction 68, result has 4.2 percent of original size [2021-08-27 06:32:25,612 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 61 [2021-08-27 06:32:25,621 INFO L354 Elim1Store]: treesize reduction 68, result has 4.2 percent of original size [2021-08-27 06:32:25,622 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 31 [2021-08-27 06:32:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:25,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848849101] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:25,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:32:25,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-08-27 06:32:25,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295134039] [2021-08-27 06:32:25,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 06:32:25,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:32:25,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 06:32:25,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-08-27 06:32:25,638 INFO L87 Difference]: Start difference. First operand 443 states and 530 transitions. Second operand has 26 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:27,235 INFO L93 Difference]: Finished difference Result 711 states and 844 transitions. [2021-08-27 06:32:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 06:32:27,236 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 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 48 [2021-08-27 06:32:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:27,237 INFO L225 Difference]: With dead ends: 711 [2021-08-27 06:32:27,237 INFO L226 Difference]: Without dead ends: 711 [2021-08-27 06:32:27,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 894.5ms TimeCoverageRelationStatistics Valid=302, Invalid=1590, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 06:32:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-08-27 06:32:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 518. [2021-08-27 06:32:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 494 states have (on average 1.2489878542510122) internal successors, (617), 514 states have internal predecessors, (617), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 620 transitions. [2021-08-27 06:32:27,254 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 620 transitions. Word has length 48 [2021-08-27 06:32:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:27,255 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 620 transitions. [2021-08-27 06:32:27,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 620 transitions. [2021-08-27 06:32:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 06:32:27,255 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:27,255 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:27,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:27,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:27,458 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr67ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:32:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:27,458 INFO L82 PathProgramCache]: Analyzing trace with hash 465337732, now seen corresponding path program 1 times [2021-08-27 06:32:27,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:32:27,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914796320] [2021-08-27 06:32:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:27,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:32:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:32:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:27,621 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-27 06:32:27,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:32:27,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914796320] [2021-08-27 06:32:27,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914796320] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:27,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880016298] [2021-08-27 06:32:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:27,621 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:27,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:32:27,624 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:32:27,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 06:32:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:29,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-27 06:32:29,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:29,448 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 17 treesize of output 9 [2021-08-27 06:32:29,455 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-27 06:32:29,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880016298] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:29,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:32:29,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2021-08-27 06:32:29,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029925405] [2021-08-27 06:32:29,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 06:32:29,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:32:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 06:32:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:32:29,456 INFO L87 Difference]: Start difference. First operand 518 states and 620 transitions. Second operand has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:30,369 INFO L93 Difference]: Finished difference Result 635 states and 747 transitions. [2021-08-27 06:32:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 06:32:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 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 49 [2021-08-27 06:32:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:30,371 INFO L225 Difference]: With dead ends: 635 [2021-08-27 06:32:30,371 INFO L226 Difference]: Without dead ends: 635 [2021-08-27 06:32:30,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 469.3ms TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 06:32:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-08-27 06:32:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 600. [2021-08-27 06:32:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 576 states have (on average 1.2586805555555556) internal successors, (725), 596 states have internal predecessors, (725), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 728 transitions. [2021-08-27 06:32:30,377 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 728 transitions. Word has length 49 [2021-08-27 06:32:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:30,377 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 728 transitions. [2021-08-27 06:32:30,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 728 transitions. [2021-08-27 06:32:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 06:32:30,378 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:30,378 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:30,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-08-27 06:32:30,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:30,589 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:32:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1188303820, now seen corresponding path program 1 times [2021-08-27 06:32:30,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:32:30,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519990068] [2021-08-27 06:32:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:30,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:32:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:32:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:31,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:32:31,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519990068] [2021-08-27 06:32:31,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519990068] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:31,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865365022] [2021-08-27 06:32:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:31,008 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:32:31,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:32:31,009 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:32:31,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 06:32:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:32,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 46 conjunts are in the unsatisfiable core [2021-08-27 06:32:32,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:32,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:32:32,646 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:32:32,646 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-27 06:32:32,682 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 23 treesize of output 19 [2021-08-27 06:32:32,760 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:32:32,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2021-08-27 06:32:32,925 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-08-27 06:32:32,926 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 28 treesize of output 45 [2021-08-27 06:32:33,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:33,015 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 06:32:33,015 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 65 treesize of output 52 [2021-08-27 06:32:33,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:33,218 INFO L354 Elim1Store]: treesize reduction 116, result has 17.1 percent of original size [2021-08-27 06:32:33,219 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 64 [2021-08-27 06:32:33,538 INFO L354 Elim1Store]: treesize reduction 182, result has 17.6 percent of original size [2021-08-27 06:32:33,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 86 [2021-08-27 06:32:33,733 INFO L354 Elim1Store]: treesize reduction 208, result has 13.0 percent of original size [2021-08-27 06:32:33,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 68 [2021-08-27 06:32:33,796 INFO L354 Elim1Store]: treesize reduction 114, result has 29.6 percent of original size [2021-08-27 06:32:33,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 97 [2021-08-27 06:32:33,971 INFO L354 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2021-08-27 06:32:33,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 123 treesize of output 94 [2021-08-27 06:32:38,458 INFO L354 Elim1Store]: treesize reduction 260, result has 13.3 percent of original size [2021-08-27 06:32:38,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 178 treesize of output 104 [2021-08-27 06:32:50,345 INFO L354 Elim1Store]: treesize reduction 182, result has 0.5 percent of original size [2021-08-27 06:32:50,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 166 treesize of output 69 [2021-08-27 06:32:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:50,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865365022] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:32:50,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:32:50,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2021-08-27 06:32:50,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140232006] [2021-08-27 06:32:50,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-27 06:32:50,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:32:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-27 06:32:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1184, Unknown=11, NotChecked=0, Total=1406 [2021-08-27 06:32:50,420 INFO L87 Difference]: Start difference. First operand 600 states and 728 transitions. Second operand has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:06,339 WARN L224 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-08-27 06:34:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-27 06:34:06,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2021-08-27 06:34:06,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-27 06:34:06,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:34:06,541 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:174) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:778) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:235) ... 56 more [2021-08-27 06:34:06,545 INFO L168 Benchmark]: Toolchain (without parser) took 299972.12 ms. Allocated memory was 65.0 MB in the beginning and 717.2 MB in the end (delta: 652.2 MB). Free memory was 43.9 MB in the beginning and 275.2 MB in the end (delta: -231.3 MB). Peak memory consumption was 419.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:34:06,545 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 65.0 MB. Free memory was 46.7 MB in the beginning and 46.6 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:34:06,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.49 ms. Allocated memory is still 65.0 MB. Free memory was 43.8 MB in the beginning and 42.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:34:06,545 INFO L168 Benchmark]: Boogie Preprocessor took 86.22 ms. Allocated memory is still 65.0 MB. Free memory was 42.6 MB in the beginning and 39.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:34:06,545 INFO L168 Benchmark]: RCFGBuilder took 690.33 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 39.6 MB in the beginning and 48.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.1 GB. [2021-08-27 06:34:06,545 INFO L168 Benchmark]: TraceAbstraction took 298924.48 ms. Allocated memory was 90.2 MB in the beginning and 717.2 MB in the end (delta: 627.0 MB). Free memory was 48.0 MB in the beginning and 275.2 MB in the end (delta: -227.2 MB). Peak memory consumption was 399.9 MB. Max. memory is 16.1 GB. [2021-08-27 06:34:06,546 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.15 ms. Allocated memory is still 65.0 MB. Free memory was 46.7 MB in the beginning and 46.6 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 266.49 ms. Allocated memory is still 65.0 MB. Free memory was 43.8 MB in the beginning and 42.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 86.22 ms. Allocated memory is still 65.0 MB. Free memory was 42.6 MB in the beginning and 39.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 690.33 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 39.6 MB in the beginning and 48.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 298924.48 ms. Allocated memory was 90.2 MB in the beginning and 717.2 MB in the end (delta: 627.0 MB). Free memory was 48.0 MB in the beginning and 275.2 MB in the end (delta: -227.2 MB). Peak memory consumption was 399.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:34:08,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:34:08,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:34:08,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:34:08,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:34:08,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:34:08,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:34:08,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:34:08,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:34:09,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:34:09,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:34:09,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:34:09,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:34:09,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:34:09,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:34:09,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:34:09,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:34:09,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:34:09,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:34:09,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:34:09,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:34:09,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:34:09,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:34:09,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:34:09,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:34:09,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:34:09,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:34:09,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:34:09,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:34:09,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:34:09,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:34:09,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:34:09,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:34:09,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:34:09,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:34:09,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:34:09,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:34:09,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:34:09,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:34:09,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:34:09,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:34:09,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:34:09,070 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:34:09,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:34:09,072 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:34:09,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:34:09,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:34:09,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:34:09,074 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:34:09,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:34:09,074 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:34:09,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:34:09,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:34:09,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:34:09,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:34:09,076 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:34:09,076 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:34:09,076 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:34:09,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:34:09,077 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:34:09,077 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:34:09,077 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:34:09,077 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:34:09,077 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:34:09,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:34:09,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:34:09,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:34:09,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:34:09,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:34:09,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:34:09,079 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:34:09,079 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:34:09,079 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:34:09,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:34:09,080 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 -> e6a59c2161f6b6239c5a03a0c424da05f95a5e0e [2021-08-27 06:34:09,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:34:09,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:34:09,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:34:09,384 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:34:09,385 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:34:09,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-08-27 06:34:09,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918dd57ef/8df53437259b4375bea85d6e66e13918/FLAGfbe98d63b [2021-08-27 06:34:09,925 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:34:09,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-08-27 06:34:09,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918dd57ef/8df53437259b4375bea85d6e66e13918/FLAGfbe98d63b [2021-08-27 06:34:10,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918dd57ef/8df53437259b4375bea85d6e66e13918 [2021-08-27 06:34:10,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:34:10,238 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:34:10,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:34:10,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:34:10,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:34:10,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f123bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10, skipping insertion in model container [2021-08-27 06:34:10,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:34:10,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:34:10,493 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-08-27 06:34:10,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:34:10,515 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:34:10,560 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-08-27 06:34:10,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:34:10,591 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:34:10,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10 WrapperNode [2021-08-27 06:34:10,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:34:10,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:34:10,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:34:10,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:34:10,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:34:10,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:34:10,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:34:10,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:34:10,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (1/1) ... [2021-08-27 06:34:10,670 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:34:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:34:10,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:34:10,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:34:10,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:34:10,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:34:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:34:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:34:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:34:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:34:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:34:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:34:10,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:34:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:34:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:34:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:34:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:34:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:34:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:34:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:34:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:34:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:34:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:34:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:34:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:34:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:34:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:34:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:34:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:34:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:34:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:34:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:34:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:34:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:34:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:34:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:34:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:34:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:34:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:34:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:34:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:34:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:34:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:34:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:34:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:34:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:34:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:34:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:34:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:34:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:34:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:34:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:34:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:34:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:34:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:34:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:34:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:34:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:34:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:34:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:34:10,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:34:10,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:34:10,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:34:10,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:34:10,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:34:10,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:34:10,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:34:10,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:34:11,507 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:34:11,507 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 06:34:11,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:34:11 BoogieIcfgContainer [2021-08-27 06:34:11,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:34:11,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:34:11,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:34:11,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:34:11,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:34:10" (1/3) ... [2021-08-27 06:34:11,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f1b7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:34:11, skipping insertion in model container [2021-08-27 06:34:11,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:34:10" (2/3) ... [2021-08-27 06:34:11,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f1b7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:34:11, skipping insertion in model container [2021-08-27 06:34:11,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:34:11" (3/3) ... [2021-08-27 06:34:11,514 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2021-08-27 06:34:11,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:34:11,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-08-27 06:34:11,540 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:34:11,544 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:34:11,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-08-27 06:34:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 78 states have (on average 2.141025641025641) internal successors, (167), 150 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:34:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:34:11,557 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:11,558 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:11,558 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:11,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1833215347, now seen corresponding path program 1 times [2021-08-27 06:34:11,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:11,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082544993] [2021-08-27 06:34:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:11,571 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:11,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:11,572 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-27 06:34:11,597 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-27 06:34:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:11,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:34:11,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:11,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:11,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:11,860 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:11,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082544993] [2021-08-27 06:34:11,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082544993] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:11,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:11,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:34:11,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023708509] [2021-08-27 06:34:11,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:34:11,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:34:11,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:34:11,874 INFO L87 Difference]: Start difference. First operand has 155 states, 78 states have (on average 2.141025641025641) internal successors, (167), 150 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:12,131 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2021-08-27 06:34:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:34:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:34:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:12,138 INFO L225 Difference]: With dead ends: 155 [2021-08-27 06:34:12,138 INFO L226 Difference]: Without dead ends: 151 [2021-08-27 06:34:12,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:34:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-08-27 06:34:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2021-08-27 06:34:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 80 states have (on average 1.925) internal successors, (154), 141 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2021-08-27 06:34:12,163 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 7 [2021-08-27 06:34:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:12,163 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2021-08-27 06:34:12,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2021-08-27 06:34:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:34:12,164 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:12,164 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:12,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:34:12,370 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-27 06:34:12,371 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:12,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1833215346, now seen corresponding path program 1 times [2021-08-27 06:34:12,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:12,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577036513] [2021-08-27 06:34:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:12,373 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:12,376 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-27 06:34:12,377 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-27 06:34:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:12,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:34:12,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:12,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:12,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:12,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:12,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577036513] [2021-08-27 06:34:12,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577036513] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:12,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:12,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:34:12,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042304834] [2021-08-27 06:34:12,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:34:12,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:34:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:34:12,634 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:12,858 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2021-08-27 06:34:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:34:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:34:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:12,860 INFO L225 Difference]: With dead ends: 140 [2021-08-27 06:34:12,860 INFO L226 Difference]: Without dead ends: 140 [2021-08-27 06:34:12,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:34:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-27 06:34:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2021-08-27 06:34:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2021-08-27 06:34:12,866 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 7 [2021-08-27 06:34:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:12,866 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2021-08-27 06:34:12,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2021-08-27 06:34:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:34:12,867 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:12,867 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:12,878 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-27 06:34:13,075 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-27 06:34:13,075 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1939317285, now seen corresponding path program 1 times [2021-08-27 06:34:13,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:13,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901925054] [2021-08-27 06:34:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:13,077 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:13,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:13,078 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-27 06:34:13,083 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-27 06:34:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:13,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:34:13,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:13,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:13,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-08-27 06:34:13,306 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 25 treesize of output 13 [2021-08-27 06:34:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:13,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:13,366 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:13,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901925054] [2021-08-27 06:34:13,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901925054] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:13,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:13,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:34:13,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757509604] [2021-08-27 06:34:13,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:34:13,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:34:13,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:34:13,368 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:13,757 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2021-08-27 06:34:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:34:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:34:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:13,759 INFO L225 Difference]: With dead ends: 179 [2021-08-27 06:34:13,759 INFO L226 Difference]: Without dead ends: 179 [2021-08-27 06:34:13,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:34:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-27 06:34:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 135. [2021-08-27 06:34:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.8) internal successors, (144), 131 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2021-08-27 06:34:13,764 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 15 [2021-08-27 06:34:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:13,764 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2021-08-27 06:34:13,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2021-08-27 06:34:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:34:13,765 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:13,765 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:13,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-27 06:34:13,972 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-27 06:34:13,972 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1939317284, now seen corresponding path program 1 times [2021-08-27 06:34:13,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:13,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144130386] [2021-08-27 06:34:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:13,974 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:13,976 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-27 06:34:13,977 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-27 06:34:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:14,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:34:14,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:14,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:14,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:34:14,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-08-27 06:34:14,191 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 39 treesize of output 27 [2021-08-27 06:34:14,193 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 24 treesize of output 12 [2021-08-27 06:34:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:14,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:14,361 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:14,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144130386] [2021-08-27 06:34:14,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144130386] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:14,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:14,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:34:14,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979532034] [2021-08-27 06:34:14,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:34:14,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:14,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:34:14,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:34:14,363 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:15,192 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2021-08-27 06:34:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:34:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:34:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:15,193 INFO L225 Difference]: With dead ends: 134 [2021-08-27 06:34:15,193 INFO L226 Difference]: Without dead ends: 134 [2021-08-27 06:34:15,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 118.2ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:34:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-27 06:34:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-08-27 06:34:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 80 states have (on average 1.7875) internal successors, (143), 130 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-08-27 06:34:15,198 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 15 [2021-08-27 06:34:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:15,198 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-08-27 06:34:15,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-08-27 06:34:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:34:15,199 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:15,199 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:15,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-08-27 06:34:15,405 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-27 06:34:15,405 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:15,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1060250921, now seen corresponding path program 1 times [2021-08-27 06:34:15,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:15,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661969396] [2021-08-27 06:34:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:15,406 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:15,407 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-27 06:34:15,409 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-27 06:34:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:15,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:34:15,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:15,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:15,614 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:34:15,615 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 19 treesize of output 24 [2021-08-27 06:34:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:15,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:15,692 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:15,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661969396] [2021-08-27 06:34:15,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661969396] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:15,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:15,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:34:15,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816598334] [2021-08-27 06:34:15,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:34:15,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:15,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:34:15,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:34:15,694 INFO L87 Difference]: Start difference. First operand 134 states and 146 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:15,972 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2021-08-27 06:34:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:34:15,972 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:34:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:15,973 INFO L225 Difference]: With dead ends: 135 [2021-08-27 06:34:15,973 INFO L226 Difference]: Without dead ends: 135 [2021-08-27 06:34:15,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 16 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:34:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-27 06:34:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2021-08-27 06:34:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 86 states have (on average 1.627906976744186) internal successors, (140), 122 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2021-08-27 06:34:15,976 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 15 [2021-08-27 06:34:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:15,976 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2021-08-27 06:34:15,976 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2021-08-27 06:34:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:34:15,977 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:15,977 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:16,006 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-27 06:34:16,186 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-27 06:34:16,186 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1060250922, now seen corresponding path program 1 times [2021-08-27 06:34:16,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:16,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094389292] [2021-08-27 06:34:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:16,187 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:16,188 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-27 06:34:16,189 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-27 06:34:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:16,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:34:16,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:16,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:16,451 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:34:16,451 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-27 06:34:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:16,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:16,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:16,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094389292] [2021-08-27 06:34:16,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094389292] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:16,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:16,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-08-27 06:34:16,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197710722] [2021-08-27 06:34:16,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:34:16,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:34:16,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:34:16,722 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:17,335 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2021-08-27 06:34:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:34:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:34:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:17,336 INFO L225 Difference]: With dead ends: 182 [2021-08-27 06:34:17,336 INFO L226 Difference]: Without dead ends: 182 [2021-08-27 06:34:17,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 168.9ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:34:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-27 06:34:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 149. [2021-08-27 06:34:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 145 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2021-08-27 06:34:17,340 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 15 [2021-08-27 06:34:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:17,340 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2021-08-27 06:34:17,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2021-08-27 06:34:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:34:17,341 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:17,341 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:17,353 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-27 06:34:17,541 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-27 06:34:17,542 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash 745751349, now seen corresponding path program 1 times [2021-08-27 06:34:17,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:17,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413823341] [2021-08-27 06:34:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:17,543 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:17,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:17,545 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-27 06:34:17,545 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-27 06:34:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:17,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:34:17,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:17,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:17,794 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 20 treesize of output 16 [2021-08-27 06:34:17,834 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 21 treesize of output 13 [2021-08-27 06:34:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:17,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:17,903 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:17,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413823341] [2021-08-27 06:34:17,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413823341] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:17,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:17,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:34:17,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137638272] [2021-08-27 06:34:17,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:34:17,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:17,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:34:17,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:34:17,905 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:18,204 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2021-08-27 06:34:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:34:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:34:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:18,205 INFO L225 Difference]: With dead ends: 148 [2021-08-27 06:34:18,205 INFO L226 Difference]: Without dead ends: 148 [2021-08-27 06:34:18,205 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:34:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-27 06:34:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-08-27 06:34:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 144 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2021-08-27 06:34:18,208 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 18 [2021-08-27 06:34:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:18,208 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2021-08-27 06:34:18,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2021-08-27 06:34:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:34:18,209 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:18,209 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:18,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-08-27 06:34:18,419 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-27 06:34:18,419 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash 745751350, now seen corresponding path program 1 times [2021-08-27 06:34:18,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:18,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268149933] [2021-08-27 06:34:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:18,420 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:18,421 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-27 06:34:18,422 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-27 06:34:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:18,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:34:18,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:18,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:18,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:34:18,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-08-27 06:34:18,724 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 23 [2021-08-27 06:34:18,726 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 20 treesize of output 12 [2021-08-27 06:34:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:18,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:18,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:18,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268149933] [2021-08-27 06:34:18,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268149933] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:18,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:18,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:34:18,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029206844] [2021-08-27 06:34:18,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:34:18,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:34:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:34:18,864 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:19,762 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2021-08-27 06:34:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:34:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:34:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:19,763 INFO L225 Difference]: With dead ends: 147 [2021-08-27 06:34:19,763 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 06:34:19,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 146.6ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:34:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 06:34:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-08-27 06:34:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 143 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2021-08-27 06:34:19,767 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 18 [2021-08-27 06:34:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:19,767 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2021-08-27 06:34:19,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2021-08-27 06:34:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:34:19,772 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:19,772 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:19,781 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-27 06:34:19,979 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-27 06:34:19,979 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr71ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:19,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash -616219460, now seen corresponding path program 1 times [2021-08-27 06:34:19,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:19,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151073126] [2021-08-27 06:34:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:19,980 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:19,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:19,981 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-27 06:34:19,983 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-27 06:34:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:20,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:34:20,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:20,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:20,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:20,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151073126] [2021-08-27 06:34:20,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151073126] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:20,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:20,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:34:20,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724947073] [2021-08-27 06:34:20,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:34:20,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:34:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:34:20,301 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:20,515 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2021-08-27 06:34:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:34:20,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:34:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:20,516 INFO L225 Difference]: With dead ends: 171 [2021-08-27 06:34:20,516 INFO L226 Difference]: Without dead ends: 171 [2021-08-27 06:34:20,516 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:34:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-27 06:34:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2021-08-27 06:34:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 111 states have (on average 1.5045045045045045) internal successors, (167), 143 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2021-08-27 06:34:20,519 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 20 [2021-08-27 06:34:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:20,519 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2021-08-27 06:34:20,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2021-08-27 06:34:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:34:20,519 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:20,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:20,532 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-27 06:34:20,720 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-27 06:34:20,720 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1847829879, now seen corresponding path program 1 times [2021-08-27 06:34:20,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:20,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341903229] [2021-08-27 06:34:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:20,721 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:20,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:20,722 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-27 06:34:20,724 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-27 06:34:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:20,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:34:20,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:20,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:21,002 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:34:21,002 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-27 06:34:21,045 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 24 treesize of output 20 [2021-08-27 06:34:21,164 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:34:21,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2021-08-27 06:34:21,246 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:34:21,246 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 [2021-08-27 06:34:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:21,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:22,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem10.base|) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.base)) c_main_~x~0.base) c_main_~x~0.offset))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:34:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:22,421 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:22,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341903229] [2021-08-27 06:34:22,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341903229] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:22,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:22,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-08-27 06:34:22,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504585610] [2021-08-27 06:34:22,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:34:22,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:34:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2021-08-27 06:34:22,423 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:34:23,620 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2021-08-27 06:34:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:34:23,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:34:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:34:23,622 INFO L225 Difference]: With dead ends: 172 [2021-08-27 06:34:23,622 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 06:34:23,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1332.5ms TimeCoverageRelationStatistics Valid=132, Invalid=333, Unknown=1, NotChecked=40, Total=506 [2021-08-27 06:34:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 06:34:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 146. [2021-08-27 06:34:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.4954954954954955) internal successors, (166), 142 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2021-08-27 06:34:23,624 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 22 [2021-08-27 06:34:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:34:23,624 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2021-08-27 06:34:23,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2021-08-27 06:34:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:34:23,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:34:23,625 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:34:23,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-08-27 06:34:23,825 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-27 06:34:23,825 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:34:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:34:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1847829880, now seen corresponding path program 1 times [2021-08-27 06:34:23,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:34:23,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044353183] [2021-08-27 06:34:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:34:23,826 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:34:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:34:23,827 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-27 06:34:23,829 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-27 06:34:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:34:24,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:34:24,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:34:24,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:24,127 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:34:24,128 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 23 treesize of output 23 [2021-08-27 06:34:24,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:34:24,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:34:24,162 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-27 06:34:24,243 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:34:24,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:34:24,257 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:34:24,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:34:24,341 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:34:24,342 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-08-27 06:34:24,347 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:34:24,347 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-08-27 06:34:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:24,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:34:36,601 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset)) (.cse1 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 c_main_~x~0.offset)) c_main_~x~0.base) c_main_~x~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 c_main_~x~0.base)) c_main_~x~0.base) c_main_~x~0.offset))))) (forall ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse2 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.offset))) c_main_~x~0.base) c_main_~x~0.offset))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-08-27 06:34:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:37,162 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:37,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044353183] [2021-08-27 06:34:37,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044353183] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:37,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:37,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-08-27 06:34:37,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138682920] [2021-08-27 06:34:37,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:34:37,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:37,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:34:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=5, NotChecked=26, Total=240 [2021-08-27 06:34:37,163 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:34:46,638 WARN L207 SmtUtils]: Spent 8.82 s on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2021-08-27 06:34:56,961 WARN L207 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2021-08-27 06:35:07,510 WARN L207 SmtUtils]: Spent 10.13 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2021-08-27 06:35:09,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset)) (.cse1 (bvadd (_ bv4 32) c_main_~x~0.offset))) (and (forall ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base|) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.offset)) c_main_~x~0.base) c_main_~x~0.offset))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (bvule .cse1 (select |c_#length| c_main_~x~0.base)) (not (= .cse2 c_main_~x~0.base)) (= (select (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset) (_ bv0 32)) (= (_ bv16 32) (select |c_#length| .cse2)) (bvule c_main_~x~0.offset .cse1) (forall ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base|) .cse3 c_main_~x~0.offset)) c_main_~x~0.base) c_main_~x~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem10.base|) .cse3 c_main_~x~0.base)) c_main_~x~0.base) c_main_~x~0.offset))))) (= |c_main_#t~mem11.offset| (_ bv0 32)) (exists ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset)) (.cse5 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5) c_main_~x~0.offset) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) c_main_~x~0.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~head~0.base))))) (_ bv1 1))) (= (_ bv16 32) (select |c_#length| |c_main_#t~mem11.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~x~0.base)))))) (_ bv1 1))))) is different from false [2021-08-27 06:35:20,666 WARN L207 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2021-08-27 06:35:22,829 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset))) (and (forall ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base|) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.offset)) c_main_~x~0.base) c_main_~x~0.offset))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= .cse1 c_main_~x~0.base)) (= c_main_~x~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset) (_ bv0 32)) (= (_ bv16 32) (select |c_#length| .cse1)) (forall ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base|) .cse2 c_main_~x~0.offset)) c_main_~x~0.base) c_main_~x~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem10.base|) .cse2 c_main_~x~0.base)) c_main_~x~0.base) c_main_~x~0.offset))))) (exists ((|main_#t~mem10.offset| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset)) (.cse4 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) c_main_~x~0.offset) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) c_main_~x~0.base)))) (= (_ bv16 32) (select |c_#length| c_main_~x~0.base)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~x~0.base)))))) (_ bv1 1))))) is different from false [2021-08-27 06:35:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:23,146 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2021-08-27 06:35:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 06:35:23,147 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:35:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:23,148 INFO L225 Difference]: With dead ends: 198 [2021-08-27 06:35:23,148 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 06:35:23,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 56588.1ms TimeCoverageRelationStatistics Valid=198, Invalid=675, Unknown=9, NotChecked=174, Total=1056 [2021-08-27 06:35:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 06:35:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 135. [2021-08-27 06:35:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 131 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-08-27 06:35:23,151 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 22 [2021-08-27 06:35:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:23,151 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-08-27 06:35:23,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-08-27 06:35:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:35:23,153 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:23,153 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:23,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-08-27 06:35:23,353 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-27 06:35:23,354 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:35:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2132242137, now seen corresponding path program 1 times [2021-08-27 06:35:23,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:23,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893439825] [2021-08-27 06:35:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:23,354 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:23,355 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-27 06:35:23,356 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-27 06:35:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:23,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:35:23,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:23,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:23,738 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:23,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893439825] [2021-08-27 06:35:23,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893439825] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:35:23,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:35:23,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:35:23,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156031985] [2021-08-27 06:35:23,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:35:23,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:35:23,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:35:23,740 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:23,761 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2021-08-27 06:35:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:35:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:35:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:23,764 INFO L225 Difference]: With dead ends: 161 [2021-08-27 06:35:23,764 INFO L226 Difference]: Without dead ends: 161 [2021-08-27 06:35:23,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:35:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-27 06:35:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2021-08-27 06:35:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 135 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2021-08-27 06:35:23,767 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 23 [2021-08-27 06:35:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:23,768 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2021-08-27 06:35:23,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2021-08-27 06:35:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:35:23,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:23,771 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:23,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-08-27 06:35:23,995 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-27 06:35:23,996 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:35:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash -851748362, now seen corresponding path program 1 times [2021-08-27 06:35:23,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:23,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106212162] [2021-08-27 06:35:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:23,997 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:23,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:24,001 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-27 06:35:24,030 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-27 06:35:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:24,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:35:24,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:24,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:35:24,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:35:24,462 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 19 treesize of output 7 [2021-08-27 06:35:24,466 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 19 treesize of output 7 [2021-08-27 06:35:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:24,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:24,669 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:24,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106212162] [2021-08-27 06:35:24,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106212162] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:35:24,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:35:24,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2021-08-27 06:35:24,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96288295] [2021-08-27 06:35:24,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:35:24,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:24,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:35:24,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:35:24,670 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:25,630 INFO L93 Difference]: Finished difference Result 273 states and 319 transitions. [2021-08-27 06:35:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:35:25,630 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:35:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:25,631 INFO L225 Difference]: With dead ends: 273 [2021-08-27 06:35:25,631 INFO L226 Difference]: Without dead ends: 273 [2021-08-27 06:35:25,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 370.0ms TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-08-27 06:35:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-27 06:35:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 148. [2021-08-27 06:35:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 144 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2021-08-27 06:35:25,634 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 25 [2021-08-27 06:35:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:25,634 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2021-08-27 06:35:25,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2021-08-27 06:35:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:35:25,635 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:25,635 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:25,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-08-27 06:35:25,835 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-27 06:35:25,835 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:35:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash 393918082, now seen corresponding path program 1 times [2021-08-27 06:35:25,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:25,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530487320] [2021-08-27 06:35:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:25,836 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:25,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:25,837 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-27 06:35:25,839 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-27 06:35:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:26,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:35:26,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:26,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:26,204 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:26,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530487320] [2021-08-27 06:35:26,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530487320] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:35:26,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:35:26,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:35:26,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110798687] [2021-08-27 06:35:26,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:35:26,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:35:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:35:26,206 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:26,240 INFO L93 Difference]: Finished difference Result 172 states and 200 transitions. [2021-08-27 06:35:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:35:26,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:35:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:26,241 INFO L225 Difference]: With dead ends: 172 [2021-08-27 06:35:26,241 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 06:35:26,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:35:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 06:35:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2021-08-27 06:35:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.373015873015873) internal successors, (173), 148 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2021-08-27 06:35:26,245 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 25 [2021-08-27 06:35:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:26,245 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2021-08-27 06:35:26,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2021-08-27 06:35:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:35:26,246 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:26,247 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:26,267 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-27 06:35:26,454 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-27 06:35:26,454 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:35:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash 599794823, now seen corresponding path program 1 times [2021-08-27 06:35:26,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:26,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81341460] [2021-08-27 06:35:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:26,455 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:26,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:26,457 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-27 06:35:26,462 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-27 06:35:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:26,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:35:26,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:26,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:35:26,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:35:26,951 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 19 treesize of output 7 [2021-08-27 06:35:26,956 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 19 treesize of output 7 [2021-08-27 06:35:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:26,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:27,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:27,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81341460] [2021-08-27 06:35:27,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81341460] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:35:27,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:35:27,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 10 [2021-08-27 06:35:27,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151124001] [2021-08-27 06:35:27,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:35:27,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:27,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:35:27,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:35:27,225 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:28,118 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2021-08-27 06:35:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:35:28,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:35:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:28,119 INFO L225 Difference]: With dead ends: 239 [2021-08-27 06:35:28,119 INFO L226 Difference]: Without dead ends: 239 [2021-08-27 06:35:28,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 237.9ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:35:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-27 06:35:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 160. [2021-08-27 06:35:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.3507462686567164) internal successors, (181), 156 states have internal predecessors, (181), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2021-08-27 06:35:28,121 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 27 [2021-08-27 06:35:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:28,122 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2021-08-27 06:35:28,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2021-08-27 06:35:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:35:28,122 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:28,122 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:28,132 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-27 06:35:28,329 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-27 06:35:28,329 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:35:28,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:28,330 INFO L82 PathProgramCache]: Analyzing trace with hash -332540930, now seen corresponding path program 1 times [2021-08-27 06:35:28,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:28,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864581576] [2021-08-27 06:35:28,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:28,330 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:28,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:28,345 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-27 06:35:28,369 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-27 06:35:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:28,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:35:28,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:28,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:35:28,765 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:35:28,765 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-27 06:35:28,803 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 26 treesize of output 22 [2021-08-27 06:35:28,919 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:35:28,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2021-08-27 06:35:29,325 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:35:29,325 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 42 [2021-08-27 06:35:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:29,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:34,335 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:34,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864581576] [2021-08-27 06:35:34,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864581576] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:35:34,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:35:34,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2021-08-27 06:35:34,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71159374] [2021-08-27 06:35:34,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:35:34,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:35:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=187, Unknown=1, NotChecked=0, Total=240 [2021-08-27 06:35:34,337 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:50,807 INFO L93 Difference]: Finished difference Result 333 states and 375 transitions. [2021-08-27 06:35:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 06:35:50,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:35:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:50,808 INFO L225 Difference]: With dead ends: 333 [2021-08-27 06:35:50,808 INFO L226 Difference]: Without dead ends: 333 [2021-08-27 06:35:50,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 5396.0ms TimeCoverageRelationStatistics Valid=168, Invalid=587, Unknown=1, NotChecked=0, Total=756 [2021-08-27 06:35:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-27 06:35:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 172. [2021-08-27 06:35:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 168 states have internal predecessors, (197), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2021-08-27 06:35:50,812 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 29 [2021-08-27 06:35:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:50,812 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2021-08-27 06:35:50,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2021-08-27 06:35:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:35:50,812 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:50,812 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:50,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-08-27 06:35:51,012 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-27 06:35:51,013 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr53REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:35:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash -332540929, now seen corresponding path program 1 times [2021-08-27 06:35:51,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:51,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559302725] [2021-08-27 06:35:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:51,014 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:51,015 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-27 06:35:51,016 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-27 06:35:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:51,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:35:51,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:51,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:35:51,488 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:35:51,489 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 16 treesize of output 16 [2021-08-27 06:35:51,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:35:51,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:35:51,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-08-27 06:35:51,631 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:35:51,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-08-27 06:35:51,645 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:35:51,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 60 [2021-08-27 06:35:52,075 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:35:52,075 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:35:52,080 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:35:52,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2021-08-27 06:35:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:52,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:57,923 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse1 (bvadd c_main_~head~0.offset (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~head~0.base) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |main_#t~mem6.offset| (_ bv0 32))) c_main_~head~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |main_#t~mem6.offset| (_ bv0 32))) c_main_~head~0.base) .cse1)))))) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (let ((.cse4 (bvadd c_main_~head~0.offset (_ bv8 32)))) (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_main_~head~0.base) .cse4))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |main_#t~mem6.offset| (_ bv0 32)))) c_main_~head~0.base) .cse4)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-08-27 06:35:58,091 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 14 treesize of output 12 [2021-08-27 06:35:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:58,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:58,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559302725] [2021-08-27 06:35:58,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559302725] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:35:58,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:35:58,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2021-08-27 06:35:58,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466146076] [2021-08-27 06:35:58,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:35:58,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:58,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:35:58,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2021-08-27 06:35:58,159 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:05,298 INFO L93 Difference]: Finished difference Result 339 states and 380 transitions. [2021-08-27 06:36:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 06:36:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:36:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:05,300 INFO L225 Difference]: With dead ends: 339 [2021-08-27 06:36:05,300 INFO L226 Difference]: Without dead ends: 339 [2021-08-27 06:36:05,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 7073.7ms TimeCoverageRelationStatistics Valid=222, Invalid=837, Unknown=1, NotChecked=62, Total=1122 [2021-08-27 06:36:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-08-27 06:36:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 172. [2021-08-27 06:36:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 168 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2021-08-27 06:36:05,303 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 29 [2021-08-27 06:36:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:05,303 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2021-08-27 06:36:05,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2021-08-27 06:36:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:36:05,303 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:05,304 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:05,314 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-27 06:36:05,504 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-27 06:36:05,504 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:36:05,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1671379426, now seen corresponding path program 1 times [2021-08-27 06:36:05,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:05,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341624481] [2021-08-27 06:36:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:05,505 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:05,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:05,506 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-27 06:36:05,513 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-27 06:36:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:05,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:36:05,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:05,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:36:05,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-08-27 06:36:06,012 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 25 treesize of output 13 [2021-08-27 06:36:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:06,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:06,084 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:06,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341624481] [2021-08-27 06:36:06,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341624481] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:06,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:06,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:36:06,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534396541] [2021-08-27 06:36:06,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:06,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:06,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:06,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:06,086 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:06,483 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2021-08-27 06:36:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:36:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:36:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:06,485 INFO L225 Difference]: With dead ends: 180 [2021-08-27 06:36:06,485 INFO L226 Difference]: Without dead ends: 180 [2021-08-27 06:36:06,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:36:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-27 06:36:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2021-08-27 06:36:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 167 states have internal predecessors, (195), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2021-08-27 06:36:06,488 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 29 [2021-08-27 06:36:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:06,489 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2021-08-27 06:36:06,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2021-08-27 06:36:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:36:06,490 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:06,490 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:06,501 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-27 06:36:06,701 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-27 06:36:06,702 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr37REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:36:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1671379425, now seen corresponding path program 1 times [2021-08-27 06:36:06,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:06,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017868916] [2021-08-27 06:36:06,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:06,703 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:06,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:06,704 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-27 06:36:06,705 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-27 06:36:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:07,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:36:07,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:07,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:36:07,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:36:07,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-08-27 06:36:07,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-08-27 06:36:07,236 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 24 treesize of output 12 [2021-08-27 06:36:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:07,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:07,416 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:07,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017868916] [2021-08-27 06:36:07,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017868916] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:07,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:07,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:36:07,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653622287] [2021-08-27 06:36:07,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:36:07,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:36:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:07,418 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:08,330 INFO L93 Difference]: Finished difference Result 170 states and 197 transitions. [2021-08-27 06:36:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:36:08,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:36:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:08,332 INFO L225 Difference]: With dead ends: 170 [2021-08-27 06:36:08,332 INFO L226 Difference]: Without dead ends: 170 [2021-08-27 06:36:08,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 134.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:36:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-27 06:36:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-08-27 06:36:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 166 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 197 transitions. [2021-08-27 06:36:08,335 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 197 transitions. Word has length 29 [2021-08-27 06:36:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:08,335 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 197 transitions. [2021-08-27 06:36:08,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 197 transitions. [2021-08-27 06:36:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:36:08,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:08,335 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:08,344 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-27 06:36:08,535 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-27 06:36:08,536 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:36:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1341930639, now seen corresponding path program 1 times [2021-08-27 06:36:08,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:08,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490863591] [2021-08-27 06:36:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:08,536 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:08,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:08,537 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-27 06:36:08,539 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-27 06:36:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:09,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:36:09,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:09,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:36:09,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:36:09,074 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:36:09,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-08-27 06:36:09,112 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-27 06:36:09,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:36:09,119 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 18 treesize of output 14 [2021-08-27 06:36:09,156 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 20 treesize of output 8 [2021-08-27 06:36:09,201 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-08-27 06:36:09,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-08-27 06:36:09,268 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 19 treesize of output 7 [2021-08-27 06:36:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:09,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:10,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_main_#t~mem6.base| (store (select |c_#memory_int| |c_main_#t~mem6.base|) |main_#t~mem6.offset| v_DerPreprocessor_1)) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))))) is different from false [2021-08-27 06:36:12,128 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (_ bv2 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |main_#t~mem6.offset| v_DerPreprocessor_1))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))))) is different from false [2021-08-27 06:36:14,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_int| c_main_~head~0.base (store (select |c_#memory_int| c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32)) v_DerPreprocessor_2)))) (store .cse0 |c_main_#t~malloc5.base| (store (select .cse0 |c_main_#t~malloc5.base|) |main_#t~mem6.offset| v_DerPreprocessor_1))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))) (_ bv2 32))) is different from false [2021-08-27 06:36:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:24,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:24,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490863591] [2021-08-27 06:36:24,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490863591] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:24,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:24,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 15 [2021-08-27 06:36:24,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889709969] [2021-08-27 06:36:24,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:36:24,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:24,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:36:24,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=103, Unknown=8, NotChecked=66, Total=210 [2021-08-27 06:36:24,312 INFO L87 Difference]: Start difference. First operand 170 states and 197 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:36,979 INFO L93 Difference]: Finished difference Result 250 states and 280 transitions. [2021-08-27 06:36:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 06:36:36,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:36:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:36,980 INFO L225 Difference]: With dead ends: 250 [2021-08-27 06:36:36,980 INFO L226 Difference]: Without dead ends: 250 [2021-08-27 06:36:36,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 26145.6ms TimeCoverageRelationStatistics Valid=144, Invalid=412, Unknown=8, NotChecked=138, Total=702 [2021-08-27 06:36:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-08-27 06:36:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 170. [2021-08-27 06:36:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.321917808219178) internal successors, (193), 166 states have internal predecessors, (193), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2021-08-27 06:36:36,983 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 31 [2021-08-27 06:36:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:36,983 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2021-08-27 06:36:36,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2021-08-27 06:36:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:36:36,983 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:36,983 INFO L512 BasicCegarLoop]: trace histogram [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-27 06:36:36,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:37,184 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-27 06:36:37,184 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr47REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:36:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1310075155, now seen corresponding path program 1 times [2021-08-27 06:36:37,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:37,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366827481] [2021-08-27 06:36:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:37,185 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:37,186 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-27 06:36:37,214 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-27 06:36:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:37,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:36:37,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:37,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:36:37,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:36:37,728 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:36:37,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:36:37,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:37,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:36:37,820 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:36:37,820 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:36:37,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:37,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:37,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:37,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:36:37,871 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-08-27 06:36:37,871 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 06:36:37,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:37,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:37,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:37,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 06:36:38,334 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-08-27 06:36:38,334 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 65 treesize of output 45 [2021-08-27 06:36:38,344 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-08-27 06:36:38,344 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 36 treesize of output 16 [2021-08-27 06:36:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:38,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:38,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:38,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366827481] [2021-08-27 06:36:38,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366827481] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:36:38,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:36:38,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2021-08-27 06:36:38,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870725746] [2021-08-27 06:36:38,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:36:38,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:36:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:36:38,564 INFO L87 Difference]: Start difference. First operand 170 states and 196 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:39,603 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2021-08-27 06:36:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:36:39,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:36:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:39,604 INFO L225 Difference]: With dead ends: 242 [2021-08-27 06:36:39,604 INFO L226 Difference]: Without dead ends: 242 [2021-08-27 06:36:39,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 378.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:36:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-27 06:36:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 183. [2021-08-27 06:36:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 179 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2021-08-27 06:36:39,607 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 31 [2021-08-27 06:36:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:39,607 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2021-08-27 06:36:39,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2021-08-27 06:36:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:36:39,608 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:39,608 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:39,619 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-27 06:36:39,817 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-27 06:36:39,817 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:36:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1490718932, now seen corresponding path program 1 times [2021-08-27 06:36:39,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:39,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211614194] [2021-08-27 06:36:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:39,818 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:39,819 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-27 06:36:39,820 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-27 06:36:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:40,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:36:40,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:40,650 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 19 treesize of output 7 [2021-08-27 06:36:40,655 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 19 treesize of output 7 [2021-08-27 06:36:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:40,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:40,961 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:40,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211614194] [2021-08-27 06:36:40,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211614194] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:40,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:40,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 15 [2021-08-27 06:36:40,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215320438] [2021-08-27 06:36:40,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:36:40,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:36:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:36:40,962 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:48,206 INFO L93 Difference]: Finished difference Result 246 states and 271 transitions. [2021-08-27 06:36:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:36:48,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-08-27 06:36:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:48,208 INFO L225 Difference]: With dead ends: 246 [2021-08-27 06:36:48,208 INFO L226 Difference]: Without dead ends: 246 [2021-08-27 06:36:48,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1003.0ms TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2021-08-27 06:36:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-08-27 06:36:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 189. [2021-08-27 06:36:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 165 states have (on average 1.303030303030303) internal successors, (215), 185 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2021-08-27 06:36:48,211 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 33 [2021-08-27 06:36:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:48,211 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2021-08-27 06:36:48,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2021-08-27 06:36:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:36:48,211 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:48,211 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:48,222 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-27 06:36:48,418 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-27 06:36:48,418 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr56ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:36:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1666617726, now seen corresponding path program 1 times [2021-08-27 06:36:48,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:48,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699365053] [2021-08-27 06:36:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:48,419 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:48,441 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-27 06:36:48,478 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-27 06:36:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:49,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 06:36:49,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:49,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:36:49,102 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:36:49,102 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 17 treesize of output 17 [2021-08-27 06:36:49,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:36:49,121 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 18 treesize of output 14 [2021-08-27 06:36:49,207 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:36:49,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 47 [2021-08-27 06:36:49,227 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:36:49,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2021-08-27 06:36:49,543 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-08-27 06:36:49,544 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 40 [2021-08-27 06:36:49,549 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:36:49,550 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 17 [2021-08-27 06:36:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:49,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:50,212 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:36:50,212 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 1013 treesize of output 869 [2021-08-27 06:36:50,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:36:50,390 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 288 treesize of output 250 [2021-08-27 06:36:50,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:36:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:50,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:50,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699365053] [2021-08-27 06:36:50,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699365053] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:50,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:50,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 17 [2021-08-27 06:36:50,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57700114] [2021-08-27 06:36:50,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 06:36:50,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 06:36:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:36:50,444 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:58,647 INFO L93 Difference]: Finished difference Result 233 states and 259 transitions. [2021-08-27 06:36:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:36:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 06:36:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:58,648 INFO L225 Difference]: With dead ends: 233 [2021-08-27 06:36:58,648 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 06:36:58,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2860.3ms TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 06:36:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 06:36:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 186. [2021-08-27 06:36:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 182 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 213 transitions. [2021-08-27 06:36:58,651 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 213 transitions. Word has length 36 [2021-08-27 06:36:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:58,651 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 213 transitions. [2021-08-27 06:36:58,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 213 transitions. [2021-08-27 06:36:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:36:58,651 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:58,652 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:58,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:58,861 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-27 06:36:58,861 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr69ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:36:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash 208801448, now seen corresponding path program 1 times [2021-08-27 06:36:58,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:58,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097855936] [2021-08-27 06:36:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:58,862 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:58,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:58,863 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-27 06:36:58,863 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-27 06:36:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:59,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:36:59,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:36:59,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:36:59,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:59,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097855936] [2021-08-27 06:36:59,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097855936] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:59,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:59,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2021-08-27 06:36:59,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843727272] [2021-08-27 06:36:59,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:36:59,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:59,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:36:59,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:36:59,877 INFO L87 Difference]: Start difference. First operand 186 states and 213 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:37:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:00,211 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2021-08-27 06:37:00,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:37:00,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-08-27 06:37:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:00,213 INFO L225 Difference]: With dead ends: 209 [2021-08-27 06:37:00,213 INFO L226 Difference]: Without dead ends: 209 [2021-08-27 06:37:00,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 70.1ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:37:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-27 06:37:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 188. [2021-08-27 06:37:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 184 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2021-08-27 06:37:00,215 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 38 [2021-08-27 06:37:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:00,216 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2021-08-27 06:37:00,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:37:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2021-08-27 06:37:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:37:00,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:00,216 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:00,237 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-27 06:37:00,417 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-27 06:37:00,417 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr65ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:37:00,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 208790463, now seen corresponding path program 1 times [2021-08-27 06:37:00,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:00,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732976706] [2021-08-27 06:37:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:00,418 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:00,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:00,433 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-27 06:37:00,485 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-27 06:37:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:01,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:37:01,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:01,305 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 20 treesize of output 8 [2021-08-27 06:37:01,324 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-27 06:37:01,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:01,490 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-08-27 06:37:01,491 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 20 treesize of output 15 [2021-08-27 06:37:01,533 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-27 06:37:01,534 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:01,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732976706] [2021-08-27 06:37:01,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732976706] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:37:01,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:01,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-08-27 06:37:01,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790076980] [2021-08-27 06:37:01,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:37:01,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:01,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:37:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:37:01,535 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:02,485 INFO L93 Difference]: Finished difference Result 280 states and 310 transitions. [2021-08-27 06:37:02,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:37:02,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:37:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:02,486 INFO L225 Difference]: With dead ends: 280 [2021-08-27 06:37:02,486 INFO L226 Difference]: Without dead ends: 280 [2021-08-27 06:37:02,487 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 265.2ms TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:37:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-08-27 06:37:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2021-08-27 06:37:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 230 states have internal predecessors, (272), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 275 transitions. [2021-08-27 06:37:02,490 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 275 transitions. Word has length 38 [2021-08-27 06:37:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:02,490 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 275 transitions. [2021-08-27 06:37:02,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 275 transitions. [2021-08-27 06:37:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:37:02,491 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:02,491 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:02,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-08-27 06:37:02,699 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-27 06:37:02,699 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 67 more)] === [2021-08-27 06:37:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 819167795, now seen corresponding path program 1 times [2021-08-27 06:37:02,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:02,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079223791] [2021-08-27 06:37:02,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:02,700 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:02,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:02,701 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-27 06:37:02,702 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-27 06:37:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:03,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 06:37:03,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:03,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-27 06:37:03,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:37:03,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:03,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:37:03,524 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:03,524 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 20 treesize of output 20 [2021-08-27 06:37:03,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-08-27 06:37:03,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:37:03,573 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 25 treesize of output 13 [2021-08-27 06:37:03,693 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:03,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 52 [2021-08-27 06:37:03,708 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-08-27 06:37:03,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2021-08-27 06:37:03,798 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:03,798 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 14 [2021-08-27 06:37:03,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 06:37:03,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 06:37:03,978 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 06:37:03,978 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 29 [2021-08-27 06:37:04,141 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:04,141 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 28 treesize of output 14 [2021-08-27 06:37:04,205 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-27 06:37:04,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:30,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_main_~x~0.offset_83 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (let ((.cse2 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (let ((.cse0 (store |c_#memory_int| |c_main_#t~mem10.base| (store (select |c_#memory_int| |c_main_#t~mem10.base|) .cse2 v_DerPreprocessor_7))) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem10.base|) .cse2 c_main_~x~0.base)) c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (store (select .cse0 .cse1) v_main_~x~0.offset_83 v_DerPreprocessor_6) (bvadd v_main_~x~0.offset_83 (_ bv12 32)) (_ bv0 32)) (bvadd (_ bv8 32) v_main_~x~0.offset_83) v_DerPreprocessor_5)))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32)))))) is different from false [2021-08-27 06:37:32,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_main_~x~0.offset_83 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset)) (.cse3 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (let ((.cse0 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse3 v_DerPreprocessor_7))) (.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 c_main_~x~0.base)) c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (store (select .cse0 .cse1) v_main_~x~0.offset_83 v_DerPreprocessor_6) (bvadd v_main_~x~0.offset_83 (_ bv12 32)) (_ bv0 32)) (bvadd (_ bv8 32) v_main_~x~0.offset_83) v_DerPreprocessor_5)))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32)))))) is different from false [2021-08-27 06:37:49,928 WARN L207 SmtUtils]: Spent 7.26 s on a formula simplification that was a NOOP. DAG size: 54 [2021-08-27 06:38:32,515 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:38:32,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079223791] [2021-08-27 06:38:32,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:38:32,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [990073110] [2021-08-27 06:38:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:32,516 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:38:32,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:38:32,518 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:38:32,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2021-08-27 06:38:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:33,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-27 06:38:33,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:33,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:33,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:38:33,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:33,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:38:33,760 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:38:33,760 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 17 treesize of output 17 [2021-08-27 06:38:33,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:33,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 06:38:33,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:33,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-08-27 06:38:34,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-08-27 06:38:34,210 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:34,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2021-08-27 06:38:34,228 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-27 06:38:34,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2021-08-27 06:38:34,454 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:38:34,455 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 28 treesize of output 14 [2021-08-27 06:38:34,463 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 7 treesize of output 3 [2021-08-27 06:38:38,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:38,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 06:38:38,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:38:38,906 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-08-27 06:38:38,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 06:38:43,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:38:43,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:38:43,132 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 06:38:43,132 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 1 case distinctions, treesize of input 32 treesize of output 23 [2021-08-27 06:38:49,709 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-27 06:38:49,732 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-27 06:38:49,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:38:54,623 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 48 treesize of output 40 [2021-08-27 06:38:56,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_110 (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_main_~x~0.base) c_main_~x~0.offset))) (store (store (store (select |c_#memory_int| v_arrayElimCell_110) .cse0 v_DerPreprocessor_10) (bvadd .cse0 (_ bv12 32)) (_ bv0 32)) (bvadd (_ bv8 32) .cse0) v_DerPreprocessor_5))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))) (_ bv2 32)))) is different from false [2021-08-27 06:38:58,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (let ((.cse2 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (let ((.cse0 (store |c_#memory_int| |c_main_#t~mem10.base| (store (select |c_#memory_int| |c_main_#t~mem10.base|) .cse2 v_DerPreprocessor_11)))) (store .cse0 v_arrayElimCell_110 (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem10.base|) .cse2 c_main_~x~0.offset)) c_main_~x~0.base) c_main_~x~0.offset))) (store (store (store (select .cse0 v_arrayElimCell_110) .cse1 v_DerPreprocessor_10) (bvadd .cse1 (_ bv12 32)) (_ bv0 32)) (bvadd (_ bv8 32) .cse1) v_DerPreprocessor_5))))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32)))))) is different from false [2021-08-27 06:39:00,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (not (= (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset)) (.cse3 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (let ((.cse0 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse3 v_DerPreprocessor_11)))) (store .cse0 v_arrayElimCell_110 (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 c_main_~x~0.offset)) c_main_~x~0.base) c_main_~x~0.offset))) (store (store (store (select .cse0 v_arrayElimCell_110) .cse1 v_DerPreprocessor_10) (bvadd .cse1 (_ bv12 32)) (_ bv0 32)) (bvadd (_ bv8 32) .cse1) v_DerPreprocessor_5))))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))) (_ bv2 32)))) is different from false [2021-08-27 06:39:02,967 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (or (and (= c_main_~x~0.offset .cse0) (= c_main_~x~0.base |c_main_#t~malloc9.base|)) (not (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_main_~x~0.base (store (select |c_#memory_int| c_main_~x~0.base) c_main_~x~0.offset v_DerPreprocessor_12)))) (store .cse2 |c_main_#t~malloc9.base| (store (select .cse2 |c_main_#t~malloc9.base|) .cse0 v_DerPreprocessor_11))))) (store .cse1 v_arrayElimCell_110 (store (store (store (select .cse1 v_arrayElimCell_110) |c_main_#t~malloc9.offset| v_DerPreprocessor_10) (bvadd |c_main_#t~malloc9.offset| (_ bv12 32)) (_ bv0 32)) (bvadd |c_main_#t~malloc9.offset| (_ bv8 32)) v_DerPreprocessor_5))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))) (_ bv2 32)))))) (or (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (not (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_int| c_main_~x~0.base (store (select |c_#memory_int| c_main_~x~0.base) c_main_~x~0.offset v_DerPreprocessor_12)))) (store .cse4 |c_main_#t~malloc9.base| (store (select .cse4 |c_main_#t~malloc9.base|) c_main_~x~0.offset v_DerPreprocessor_11))))) (store .cse3 v_arrayElimCell_110 (store (store (store (select .cse3 v_arrayElimCell_110) c_main_~x~0.offset v_DerPreprocessor_10) (bvadd c_main_~x~0.offset (_ bv12 32)) (_ bv0 32)) (bvadd (_ bv8 32) c_main_~x~0.offset) v_DerPreprocessor_5))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))) (_ bv2 32)))) (not (= c_main_~x~0.base |c_main_#t~malloc9.base|)))) is different from false [2021-08-27 06:39:41,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc9.base_17| (_ BitVec 32))) (or (and (or (not (= c_main_~head~0.base |v_main_#t~malloc9.base_17|)) (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (not (= (_ bv2 32) (let ((.cse1 (bvadd c_main_~head~0.offset (_ bv12 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| c_main_~head~0.base (store (select |c_#memory_int| c_main_~head~0.base) c_main_~head~0.offset v_DerPreprocessor_12)))) (store .cse2 |v_main_#t~malloc9.base_17| (store (select .cse2 |v_main_#t~malloc9.base_17|) c_main_~head~0.offset v_DerPreprocessor_11))))) (store .cse0 v_arrayElimCell_110 (store (store (store (select .cse0 v_arrayElimCell_110) c_main_~head~0.offset v_DerPreprocessor_10) .cse1 (_ bv0 32)) (bvadd c_main_~head~0.offset (_ bv8 32)) v_DerPreprocessor_5))) c_main_~head~0.base) .cse1)))))) (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse5 (bvadd (_ bv4 32) |main_#t~mem10.offset|))) (or (not (= (_ bv2 32) (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_int| c_main_~head~0.base (store (select |c_#memory_int| c_main_~head~0.base) c_main_~head~0.offset v_DerPreprocessor_12)))) (store .cse4 |v_main_#t~malloc9.base_17| (store (select .cse4 |v_main_#t~malloc9.base_17|) .cse5 v_DerPreprocessor_11))))) (store .cse3 v_arrayElimCell_110 (store (store (store (select .cse3 v_arrayElimCell_110) (_ bv0 32) v_DerPreprocessor_10) (_ bv12 32) (_ bv0 32)) (_ bv8 32) v_DerPreprocessor_5))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv12 32))))) (and (= c_main_~head~0.base |v_main_#t~malloc9.base_17|) (= c_main_~head~0.offset .cse5)))))) (not (= (_ bv0 1) (select |c_#valid| |v_main_#t~malloc9.base_17|))))) is different from false [2021-08-27 06:39:42,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:39:42,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239213882] [2021-08-27 06:39:42,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:42,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:39:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:39:42,167 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:39:42,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-27 06:39:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:43,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:39:43,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:43,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:39:43,987 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:39:43,987 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 18 treesize of output 18 [2021-08-27 06:39:44,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:44,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-08-27 06:39:44,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:45,017 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-08-27 06:39:45,018 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 39 treesize of output 36 [2021-08-27 06:39:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:46,302 INFO L354 Elim1Store]: treesize reduction 108, result has 22.9 percent of original size [2021-08-27 06:39:46,303 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 49 treesize of output 55 [2021-08-27 06:39:46,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:46,735 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:39:46,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2021-08-27 06:39:46,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:46,805 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-08-27 06:39:46,806 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 54 treesize of output 46 [2021-08-27 06:39:47,842 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-08-27 06:39:47,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 32 [2021-08-27 06:39:48,063 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-27 06:39:48,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:40:37,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32))) (= (_ bv0 1) (bvadd (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_main_#t~mem11.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem11.base|) main_~x~0.offset (_ bv0 32)) (bvadd main_~x~0.offset (_ bv12 32)) v_DerPreprocessor_13) (bvadd (_ bv8 32) main_~x~0.offset) |c_main_#t~mem11.base|)) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32))))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:41:05,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_main_~x~0.offset_91 (_ BitVec 32)) (v_DerPreprocessor_13 (_ 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 (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_main_#t~mem10.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem10.base|) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.base)))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (store (select .cse0 .cse1) v_main_~x~0.offset_91 (_ bv0 32)) (bvadd v_main_~x~0.offset_91 (_ bv12 32)) v_DerPreprocessor_13) (bvadd (_ bv8 32) v_main_~x~0.offset_91) .cse1)))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32)))))))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:41:07,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_main_~x~0.offset_91 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (store (select .cse0 .cse1) v_main_~x~0.offset_91 (_ bv0 32)) (bvadd v_main_~x~0.offset_91 (_ bv12 32)) v_DerPreprocessor_13) (bvadd (_ bv8 32) v_main_~x~0.offset_91) .cse1)))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32)))))))))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:41:07,207 INFO L354 Elim1Store]: treesize reduction 5, result has 97.1 percent of original size [2021-08-27 06:41:07,208 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 206 treesize of output 205 [2021-08-27 06:41:09,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_main_~x~0.offset_91 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset |c_main_#t~malloc9.base|)))) (store .cse2 |c_main_#t~malloc9.base| (store (select .cse2 |c_main_#t~malloc9.base|) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (store (select .cse0 .cse1) v_main_~x~0.offset_91 (_ bv0 32)) (bvadd v_main_~x~0.offset_91 (_ bv12 32)) v_DerPreprocessor_13) (bvadd (_ bv8 32) v_main_~x~0.offset_91) .cse1)))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32))) c_main_~x~0.base)) is different from false [2021-08-27 06:41:11,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc9.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_main_#t~malloc9.base_19|))) (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_main_~x~0.offset_91 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset |v_main_#t~malloc9.base_19|)))) (store .cse2 |v_main_#t~malloc9.base_19| (store (select .cse2 |v_main_#t~malloc9.base_19|) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (store (select .cse0 .cse1) v_main_~x~0.offset_91 (_ bv0 32)) (bvadd v_main_~x~0.offset_91 (_ bv12 32)) v_DerPreprocessor_13) (bvadd (_ bv8 32) v_main_~x~0.offset_91) .cse1)))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32))) c_main_~x~0.base)))) is different from false [2021-08-27 06:41:13,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem10.offset| (_ BitVec 32)) (v_main_~x~0.offset_91 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_main_#t~malloc9.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_main_#t~malloc9.base_19|))) (= c_main_~head~0.base (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| c_main_~head~0.base (store (select |c_#memory_$Pointer$.base| c_main_~head~0.base) c_main_~head~0.offset |v_main_#t~malloc9.base_19|)))) (store .cse2 |v_main_#t~malloc9.base_19| (store (select .cse2 |v_main_#t~malloc9.base_19|) (bvadd (_ bv4 32) |main_#t~mem10.offset|) c_main_~head~0.base))))) (let ((.cse1 (select (select .cse0 c_main_~head~0.base) c_main_~head~0.offset))) (store .cse0 .cse1 (store (store (store (select .cse0 .cse1) v_main_~x~0.offset_91 (_ bv0 32)) (bvadd v_main_~x~0.offset_91 (_ bv12 32)) v_DerPreprocessor_13) (bvadd (_ bv8 32) v_main_~x~0.offset_91) .cse1)))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32)))))) is different from false [2021-08-27 06:41:18,497 WARN L207 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 571 DAG size of output: 547 [2021-08-27 06:41:18,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-27 06:41:18,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:18,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:41:18,500 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:41:18,500 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:41:18,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 06:41:18,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:41:18,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:41:18,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:41:18,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:41:18,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:41:18,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:41:18,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-08-27 06:41:18,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:18,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:18,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:18,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:18,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:41:18,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:41:18,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:18,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-08-27 06:41:18,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:19,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:41:19,141 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:41:19,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:41:19 BoogieIcfgContainer [2021-08-27 06:41:19,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:41:19,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:41:19,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:41:19,148 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:41:19,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:34:11" (3/4) ... [2021-08-27 06:41:19,150 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:41:19,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:41:19,151 INFO L168 Benchmark]: Toolchain (without parser) took 428912.64 ms. Allocated memory was 48.2 MB in the beginning and 465.6 MB in the end (delta: 417.3 MB). Free memory was 22.8 MB in the beginning and 216.0 MB in the end (delta: -193.3 MB). Peak memory consumption was 224.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:19,151 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 48.2 MB. Free memory was 30.6 MB in the beginning and 30.5 MB in the end (delta: 52.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:41:19,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.52 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 22.6 MB in the beginning and 41.4 MB in the end (delta: -18.8 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:19,151 INFO L168 Benchmark]: Boogie Preprocessor took 72.17 ms. Allocated memory is still 65.0 MB. Free memory was 41.4 MB in the beginning and 38.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:19,151 INFO L168 Benchmark]: RCFGBuilder took 844.04 ms. Allocated memory was 65.0 MB in the beginning and 81.8 MB in the end (delta: 16.8 MB). Free memory was 38.0 MB in the beginning and 57.2 MB in the end (delta: -19.2 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:19,152 INFO L168 Benchmark]: TraceAbstraction took 427637.54 ms. Allocated memory was 81.8 MB in the beginning and 465.6 MB in the end (delta: 383.8 MB). Free memory was 57.2 MB in the beginning and 216.0 MB in the end (delta: -158.8 MB). Peak memory consumption was 297.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:41:19,152 INFO L168 Benchmark]: Witness Printer took 2.47 ms. Allocated memory is still 465.6 MB. Free memory is still 216.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:41:19,153 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 48.2 MB. Free memory was 30.6 MB in the beginning and 30.5 MB in the end (delta: 52.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 352.52 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 22.6 MB in the beginning and 41.4 MB in the end (delta: -18.8 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.17 ms. Allocated memory is still 65.0 MB. Free memory was 41.4 MB in the beginning and 38.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 844.04 ms. Allocated memory was 65.0 MB in the beginning and 81.8 MB in the end (delta: 16.8 MB). Free memory was 38.0 MB in the beginning and 57.2 MB in the end (delta: -19.2 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 427637.54 ms. Allocated memory was 81.8 MB in the beginning and 465.6 MB in the end (delta: 383.8 MB). Free memory was 57.2 MB in the beginning and 216.0 MB in the end (delta: -158.8 MB). Peak memory consumption was 297.4 MB. Max. memory is 16.1 GB. * Witness Printer took 2.47 ms. Allocated memory is still 465.6 MB. Free memory is still 216.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] head->data = 0 [L1000] head->opt = head [L1001] SLL* x = head; [L1003] COND TRUE __VERIFIER_nondet_int() [L1003] x->next = malloc(sizeof(SLL)) [L1003] EXPR x->next [L1003] x->next->prev = x [L1003] EXPR x->next [L1003] x = x->next [L1003] x->next = ((void*)0) [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1003] x->data = 0 [L1003] x->opt = x [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head [L1007] COND TRUE x != ((void*)0) [L1009] EXPR x->data [L1009] EXPR x->data == 2 && x->opt != x [L1009] EXPR x->opt [L1009] EXPR x->data == 2 && x->opt != x [L1009] x->data == 2 && x->opt != x && x->opt->next == ((void*)0) [L1009] EXPR x->opt [L1009] x->opt->next - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: 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 5 procedures, 164 locations, 72 error locations. Started 1 CEGAR loops. OverallTime: 427600.0ms, OverallIterations: 26, TraceHistogramMax: 2, EmptinessCheckTime: 20.9ms, AutomataDifference: 108517.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2291 SDtfs, 5033 SDslu, 7911 SDs, 0 SdLazy, 8489 SolverSat, 573 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 43676.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1336 GetRequests, 927 SyntacticMatches, 72 SemanticMatches, 337 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 102504.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=25, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 86.5ms AutomataMinimizationTime, 25 MinimizatonAttempts, 1102 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 271.6ms SsaConstructionTime, 936.3ms SatisfiabilityAnalysisTime, 49383.5ms InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1144 ConstructedInterpolants, 65 QuantifiedInterpolants, 12336 SizeOfPredicates, 167 NumberOfNonLiveVariables, 2943 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 50 InterpolantComputations, 46 PerfectInterpolantSequences, 4/8 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-27 06:41:19,249 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...